login
A215339
a(n) = A001608(n) mod n.
3
0, 0, 0, 2, 0, 5, 0, 2, 3, 7, 0, 5, 0, 9, 8, 10, 0, 14, 0, 17, 10, 2, 0, 13, 5, 15, 12, 23, 0, 20, 0, 26, 25, 19, 12, 2, 0, 21, 3, 5, 0, 33, 0, 2, 32, 2, 0, 21, 7, 42, 20, 41, 0, 23, 27, 3, 41, 2, 0, 34, 0, 33, 61, 26, 44, 27, 0, 53, 26, 31, 0, 34, 0, 2, 68, 21, 29, 18, 0, 5, 39, 43, 0, 71, 39, 2, 3, 10, 0, 83, 46, 2, 65, 49
OFFSET
1,4
COMMENTS
a(n) = 0 for n=1, n a prime, or n a Perrin pseudoprime (A013998).
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..10000 (terms 1..1001 from Joerg Arndt)
PROG
(PARI)
M = [0, 1, 0; 0, 0, 1; 1, 1, 0];
a(n)=lift( trace( Mod(M, n)^n ) );
vector(66, n, a(n))
CROSSREFS
Cf. A001608 (Perrin sequence), A013998 (Perrin pseudoprimes).
Sequence in context: A086134 A071090 A105221 * A061376 A058974 A369744
KEYWORD
nonn
AUTHOR
Joerg Arndt, Aug 16 2012
STATUS
approved