|
Search: id:A118498
|
|
|
| A118498 |
|
A recursive formula for a 20th power prime producing polynomial. |
|
+0
1
|
|
| 152821, 152843, 11687201, 38354781331, 12094628058533, 1049041748199971, 40217742840845953, 877714929273885371, 12682136550675470261, 133734320049626370523, 1100000000000000153921, 7400249944258160255363
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Program is automated so that all you have to do is put in the prime generating polynomial to get the recurive function out. As the larger the power of the polynomial, the larger numbers produced, this produces very large primes at a rate of about 18/60 or 300/1000
|
|
FORMULA
|
f[x_] = 152821 + 11*x^2 + 11 *x^20 a(n) = a(n-1)+f[n] - f[n - 1]
|
|
MATHEMATICA
|
f[x_] = 152821 + 11*x^2 + 11 *x^20 a[0] = Reverse[CoefficientList[f[x], x]][[21]] a[n_] := a[n] = a[n - 1] + Expand[f[n] - f[n - 1]] a0 = Table[f[n], {n, 0, 40}] a1 = Table[a[n], {n, 0, 40}] Apply[Plus, a0 - a1]
|
|
CROSSREFS
|
Sequence in context: A138264 A086691 A112625 this_sequence A073086 A101767 A050520
Adjacent sequences: A118495 A118496 A118497 this_sequence A118499 A118500 A118501
|
|
KEYWORD
|
nonn,uned,less
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), May 05 2006
|
|
|
Search completed in 0.002 seconds
|
