login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A130165 a(0)=1; a(n)=prime(mod(a(n-1),10)). 0
1, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2, 3, 5, 11, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Starting with the second term, cycles every four terms.

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

LINKS

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

FORMULA

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

MATHEMATICA

f[s_List] := Block[{}, Append[s, Prime@ Last@ Mod[s, 10]]]; Nest[f, {1}, 93]

CROSSREFS

Sequence in context: A154956 A197312 A259387 * A083397 A067362 A248793

Adjacent sequences:  A130162 A130163 A130164 * A130166 A130167 A130168

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 May 19 17:48 EDT 2019. Contains 323395 sequences. (Running on oeis4.)