This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A051335 Euclid-Mullin sequence (A000945) with initial value a(1)=127 instead of a(1)=2. 33
 127, 2, 3, 7, 5, 149, 19, 41, 23899, 139, 43, 761, 281, 17, 53, 2551, 23, 20149, 100720363856036298033578901613089271, 31, 179, 11, 13, 523, 282995646721, 2871347, 83, 10744429, 1031, 427773048135533, 97, 78506876242349, 67 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Robert Price, Table of n, a(n) for n = 1..47 MATHEMATICA a[1]=127; a[n_] := First[ Flatten[ FactorInteger[ 1+Product[ a[ j ], {j, 1, n-1} ] ] ] ]; Array[a, 10] PROG (PARI) spf(n)=my(f=factor(n)[1, 1]); f; first(m)={my(v=vector(m)); v[1]=127; for(i=2, m, v[i]=spf(1+prod(j=1, i-1, v[j]))); v; } /* Anders HellstrÃ¶m, Aug 18 2015 */ CROSSREFS Cf. A000945, A000946, A005265, A005266. Sequence in context: A281478 A212927 A300785 * A186995 A145586 A180352 Adjacent sequences:  A051332 A051333 A051334 * A051336 A051337 A051338 KEYWORD easy,nonn AUTHOR 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.

Last modified December 13 06:26 EST 2019. Contains 329968 sequences. (Running on oeis4.)