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

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

Offset

1,2

Comments

Starting with the second term, cycles every four terms.

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

Links

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

Index entries for linear recurrences with constant coefficients, signature (0,0,0,1).

Formula

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

G.f.: x -x^2*(2+3*x+5*x^2+11*x^3) / ( (x-1)*(1+x)*(1+x^2) ). - R. J. Mathar, Jun 20 2021

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 A364201

Adjacent sequences: A130162 A130163 A130164 * A130166 A130167 A130168

Keyword

nonn,less,easy

Author

Robert G. Wilson v, May 13 2007

Extensions

NAME adapted to offset. - R. J. Mathar, Jun 20 2021

Status

approved