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!)
A130166 a(1)=1; a(n)=prime(mod(a(n-1),1000)). 0

%I #7 Jun 20 2021 08:32:34

%S 1,2,3,5,11,31,127,709,5381,2621,4591,4327,2179,1063,307,2027,103,563,

%T 4091,467,3319,2113,617,4549,3967,7607,4463,3299,1979,7717,5431,3001,

%U 2,3,5,11,31,127,709,5381,2621,4591,4327,2179,1063,307,2027,103,563,4091

%N a(1)=1; a(n)=prime(mod(a(n-1),1000)).

%C Starting with the second term, cycles every 31 terms.

%C Not the same sequence as a(1)=1; a(n)=mod(prime(a(n-1)),1000).

%F a(1)=1; a(n)=prime(mod(a(n-1),1000)).

%t f[s_List] := Block[{}, Append[s, Mod[ Prime@ Last@ s, 1000]]]; Nest[f, {2}, 50]

%t NestList[Prime[Mod[#,1000]]&,1,50] (* _Harvey P. Dale_, Jun 01 2012 *)

%K nonn,less

%O 1,2

%A _Robert G. Wilson v_, May 13 2007

%E NAME adapted to offset. - _R. J. Mathar_, Jun 20 2021

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 April 25 05:18 EDT 2024. Contains 371964 sequences. (Running on oeis4.)