Perrin-type sequence?

[Russell Walsmith]

Playing around with ordered triplets based on C6, I found a sequence S
where, iff n is prime, it divides S[n]. This works for 100 terms, anyway,
which is as far as my coding chops take me for the nonce. I intend to submit
this as *A117404 in the next week or two, and I am definitely appreciaive it
if any SeqFans have some insights to offer in the interim. Thanks.

Ciao, Russell

More info in appendix II at
http://ixitol.com/Triternions.pdf

*0,3,5,3,15,13,105,117,175,387,825,3397,2145,7347,7735,38037,
101745,15133,260775,59163,1508225,2793453,1142295,8121803,
4835985,54100413,68310905,80981883,220007775,372355213,
1789257225,1373578197,3635967055,4835312547,18298490265,
54819609637,15985386945,134573574867,61076169175,752096037237,
1546156527825,362715993347,4348318849095,1500591635397,
27689960053985,39279779556813,36295688570295,123046062619883,
162874180016625,936533407206813,847986640561625,1772247081423003,
2912393829984255,8680194123078253,29336968697756265...
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20060312/1f371be6/attachment.htm>