|
Search: id:A118124
|
|
|
| A118124 |
|
Euler triangular prime generating polynomial. |
|
+0
1
|
|
| 41, 43, 47, 47, 53, 61, 53, 61, 71, 83, 61, 71, 83, 97, 113, 71, 83, 97, 113, 131, 151, 83, 97, 113, 131, 151, 173, 197, 97, 113, 131, 151, 173, 197, 223, 251, 113, 131, 151, 173, 197, 223, 251, 281, 313, 131, 151, 173, 197, 223, 251, 281, 313, 347, 383, 151, 173
(list; table; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
The triangular function produces primes at a rate of 883.856/1000 for the first 1000: not unique primes as antidiagonals repeat
|
|
FORMULA
|
a(n,m) =(n+m)^2+n+m+41
|
|
EXAMPLE
|
41
43, 47
47, 53, 61
53, 61, 71, 83
61, 71, 83, 97, 113
71, 83, 97, 113, 131, 151
83, 97, 113, 131, 151, 173, 197
97, 113, 131, 151, 173, 197, 223, 251
113, 131, 151, 173, 197, 223, 251, 281, 313
131, 151, 173, 197, 223, 251, 281, 313, 347, 383
151, 173, 197, 223, 251, 281, 313, 347, 383, 421, 461
|
|
MATHEMATICA
|
f[n_] = n^2 + n + 41 t[n_, m_] = f[n + m] a = Table[Table[t[n, m], {n, 0, m}], {m, 0, 10}] c = Flatten[a]
|
|
CROSSREFS
|
Sequence in context: A041839 A098064 A073921 this_sequence A054057 A155884 A005846
Adjacent sequences: A118121 A118122 A118123 this_sequence A118125 A118126 A118127
|
|
KEYWORD
|
nonn,uned,tabl
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 12 2006
|
|
|
Search completed in 0.002 seconds
|
