|
Search: id:A108583
|
|
|
| A108583 |
|
Let b(n) = b(n-1)+A005185(n) [with what initial term?]; sequence gives primes of the form 1 + Product_{i=1..k} b(i). |
|
+0
1
|
| |
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Using a sequence starting at 2 with a chaotic gap to simulate the primes, this is a Euclid prime analog.
|
|
FORMULA
|
b(n) = b(n-1)+A005185[[n]] a(m)=if Product[b[n], {n, 1, m}]+1 is prime then Product[b[n], {n, 1, m}]+1
|
|
MATHEMATICA
|
Hofstadter[0] = Hofstadter[1] = 1 Hofstadter[n_Integer?Positive] := Hofstadter[n] = Hofstadter[n - Hofstadter[n - 1]] + Hofstadter[n - Hofstadter[n - 2]] a[1] = 2; a[n_] := a[n] = a[n - 1] + 2*Hofstadter[n] b = Flatten[Table[If[PrimeQ[Product[a[n], {n, 1, m}] + 1] == True, Product[a[n], {n, 1, m}] + 1, {}], {m, 1, 200}]]
|
|
CROSSREFS
|
Cf. A018239, A005185.
Adjacent sequences: A108580 A108581 A108582 this_sequence A108584 A108585 A108586
Sequence in context: A006715 A138487 A022507 this_sequence A119987 A127855 A087333
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Jul 05 2005
|
|
|
Search completed in 0.002 seconds
|
