The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A215339 a(n) = A001608(n) mod n. 3

%I #20 Jul 21 2017 10:09:28

%S 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,

%T 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,

%U 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

%N a(n) = A001608(n) mod n.

%C a(n) = 0 for n=1, n a prime, or n a Perrin pseudoprime (A013998).

%H Seiichi Manyama, <a href="/A215339/b215339.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1001 from Joerg Arndt)

%o (PARI)

%o M = [0, 1, 0; 0, 0, 1; 1, 1, 0];

%o a(n)=lift( trace( Mod(M,n)^n ) );

%o vector(66,n,a(n))

%Y Cf. A001608 (Perrin sequence), A013998 (Perrin pseudoprimes).

%K nonn

%O 1,4

%A _Joerg Arndt_, Aug 16 2012

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 03:59 EDT 2024. Contains 372528 sequences. (Running on oeis4.)