cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A214523 a(1) = 13, a(n) is smallest prime of the form k*a(n-1) + 1.

Original entry on oeis.org

13, 53, 107, 643, 7717, 30869, 432167, 6050339, 12100679, 169409507, 9148113379, 439109442193, 5269313306317, 84309012901073, 7587811161096571, 303512446443862841, 69807862682088453431, 2652698781919361230379, 143245734223645506440467
Offset: 1

Views

Author

Robin Garcia, Jul 23 2012

Keywords

Comments

Sequence does not begin with a(1) = 2 or 3 (13 = 6*2+1 = 4*3*1; but 2*2+1 =5 or 2*3 +1 = 7 are smaller) , because this would be A061092 or A059411.

Examples

			53 = 4*13 + 1 ; 107 = 2*53 + 1.
		

Crossrefs

Programs

  • Mathematica
    t = {13}; Do[k = 1; While[p = k*t[[-1]] + 1; ! PrimeQ[p], k++]; AppendTo[t, p], {20}]; t (* T. D. Noe, Jul 24 2012 *)
    nxt[n_]:=Module[{k=1},While[!PrimeQ[k*n+1],k++];n*k+1]; NestList[nxt,13,20] (* Harvey P. Dale, Apr 28 2014 *)
  • PARI
    a=13;for(n=1,200,b=a*n+1;if(isprime(b),a=b;print1(a,", ");next(n=1)))