Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130166
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130166 a(0)=1; a(n)=prime(mod(a(n-1),1000)). +0
1
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; listen)
OFFSET

1,2

COMMENT

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).

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]

CROSSREFS

Adjacent sequences: A130163 A130164 A130165 this_sequence A130167 A130168 A130169

Sequence in context: A079557 A090709 A112279 this_sequence A007097 A132745 A124538

KEYWORD

nonn,less

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), May 13 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research