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!)
A112279 a(1)=1; a(n)=prime(mod(a(n-1),100)). 2

%I

%S 1,2,3,5,11,31,127,103,5,11,31,127,103,5,11,31,127,103,5,11,31,127,

%T 103,5,11,31,127,103,5,11,31,127,103,5,11,31,127,103,5,11,31,127,103,

%U 5,11,31,127,103,5,11,31,127,103,5,11,31,127,103,5,11,31,127,103,5,11,31,127

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

%C Starting with the third term, cycles every five terms. - _Robert G. Wilson v_, Dec 13 2005

%D Zak Seidov, Posting to Seq Fan mailing list, Nov 28 2005

%F G.f.: x*(-100*x^7 - 125*x^6 - 30*x^5 - 11*x^4 - 5*x^3 - 3*x^2 - 2*x - 1)/(x^5 - 1). - _Chai Wah Wu_, Sep 26 2019

%t a[1] = 1; a[n_] := a[n] = Prime[Mod[a[n - 1], 100]], Table[ a[n], {n, 1, 66}] (* _Robert G. Wilson v_ *)

%o (MAGMA) [n le 1 select 1 else NthPrime(Self(n-1) mod 100):n in [1..75]]; // _Marius A. Burtea_, Sep 26 2019

%K nonn,less

%O 1,2

%A _N. J. A. Sloane_, Nov 24 2005

%E More terms from _Robert G. Wilson v_, Dec 13 2005

%E Offset corrected by _N. J. A. Sloane_, Dec 10 2014 at the suggestion of _Zak Seidov_.

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 8 11:31 EDT 2020. Contains 336298 sequences. (Running on oeis4.)