|
| |
|
|
A118498
|
|
11n^20 + 11x^2 + 152821
|
|
0
| |
|
|
152821, 152843, 11687201, 38354781331, 12094628058533, 1049041748199971, 40217742840845953, 877714929273885371, 12682136550675470261, 133734320049626370523, 1100000000000000153921, 7400249944258160255363
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| "A recursive formula for a 20th power prime producing polynomial."
Program is automated so that all you have to do is put in the prime generating polynomial to get the recursive 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.
2.579% of the first million values are prime. [From Charles R Greathouse IV, Mar 20 2010]
|
|
|
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: A205462 A086691 A112625 * A172732 A172789 A073086
Adjacent sequences: A118495 A118496 A118497 * A118499 A118500 A118501
|
|
|
KEYWORD
| nonn,less
|
|
|
AUTHOR
| Roger Bagula (rlbagulatftn(AT)yahoo.com), May 05 2006
|
|
|
EXTENSIONS
| Edited by Charles R Greathouse IV (charles.greathouse(AT)case.edu), Mar 20 2010
|
| |
|
|
