Perrin-type sequence?

[Max]

On 3/12/06, Russell Walsmith <ixitol at gmail.com> wrote:
> Playing around with ordered triplets based on C6, I found a sequence S
> where, iff n is prime, it divides S[n].

What is special about this sequence except that property?

There is a regular way to construct sequences ala Perrin, e.g., as described at:
http://www.mathlinks.ro/Forum/viewtopic.php?p=297640#p297640

So I doubt that Perrin-like sequences are interesting unless they have
some other properties/applications.

Max