login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130166 a(0)=1; a(n)=prime(mod(a(n-1),1000)). 0
1, 2, 3, 5, 11, 31, 127, 709, 5381, 2621, 4591, 4327, 2179, 1063, 307, 2027, 103, 563, 4091, 467, 3319, 2113, 617, 4549, 3967, 7607, 4463, 3299, 1979, 7717, 5431, 3001, 2, 3, 5, 11, 31, 127, 709, 5381, 2621, 4591, 4327, 2179, 1063, 307, 2027, 103, 563, 4091 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Starting with the second term, cycles every 31 terms.

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

LINKS

Table of n, a(n) for n=1..50.

FORMULA

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

MATHEMATICA

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

NestList[Prime[Mod[#, 1000]]&, 1, 50] (* Harvey P. Dale, Jun 01 2012 *)

CROSSREFS

Sequence in context: A079557 A090709 A112279 * A007097 A173422 A132745

Adjacent sequences:  A130163 A130164 A130165 * A130167 A130168 A130169

KEYWORD

nonn,less

AUTHOR

Robert G. Wilson v, May 13 2007

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 3 13:21 EDT 2020. Contains 336198 sequences. (Running on oeis4.)