|
| |
|
|
A077258
|
|
Least number which can be represented by the difference between two successive prime powers of prime numbers (A076707) in just n ways.
|
|
2
| | |
|
|
|
OFFSET
| 1,2
|
|
|
EXAMPLE
| 1 = 9-8, 4 = 8-4 & 125-121, 6888 = 332929 - 326041 = 744769 - 737881 = 2968729 - 2961841, 4920 = 44521 - 39601 = 63001 - 58081 = 380689 - 375769 = 1515361 - 1510441 and
187117320 = 9725896737769 - 9725709620449 = 21883150711249 - 21882963593929 = 60786363426721 - 60786176309401 = 243145173030769 - 243144985913449 = 2188305808807561 - 2188305621690241.
|
|
|
MATHEMATICA
| pp = Sort[ Flatten[ Table[ Prime[n]^Prime[i], {n, 1, PrimePi[ Sqrt[10^16]]}, {i, 1, PrimePi[ Floor[ Log[ Prime[n], 10^16]]]}]]]; l = Length[pp]; b = Sort[ Take[pp, -l + 1] - Take[pp, l - 1]];
|
|
|
CROSSREFS
| Cf. A053810, A075308, A076707, A077257.
Sequence in context: A046360 A079232 A137045 * A058440 A058464 A053951
Adjacent sequences: A077255 A077256 A077257 * A077259 A077260 A077261
|
|
|
KEYWORD
| more,nonn
|
|
|
AUTHOR
| Zak Seidov (zakseidov(AT)yahoo.com) and Robert G. Wilson v (rgwv(AT)rgwv.com), Oct 31 2002
|
| |
|
|
