|
Search: id:A016067
|
|
|
| A016067 |
|
Consider all ways of writing a number as p+2m^2 where p is 1 or a prime and m >= 0; sequence gives numbers that are expressible in at least 2 more ways than any smaller number. |
|
+0
5
|
|
| 3, 139, 181, 619, 2341, 3331, 4189, 4801, 5911, 6319, 8251, 9751, 11311, 12739, 13051, 15889, 20641, 21349, 22741, 23659, 24079, 32191, 33631, 39961, 42871, 45769, 56131, 57511, 65341, 71839, 80149, 90919, 95989, 99181, 105271, 119131
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
G. H. Hardy and J. E. Littlewood, Some problems of `partitio numerorum'; III: On the expression of a number as a sum of primes, Acta Math., 44 (1922) pp. 1-70.
M. A. Stern, Sur un assertion de Goldbach relative aux nombres impairs, Nouvelles Annales Math., 15 (1856) pp. 23-24.
|
|
LINKS
|
L. Hodges, A lesser-known Goldbach conjecture, Math. Mag., 66 (1993), 45-47.
Index entries for sequences related to Goldbach conjecture
|
|
CROSSREFS
|
Cf. A007697.
Adjacent sequences: A016064 A016065 A016066 this_sequence A016068 A016069 A016070
Sequence in context: A049677 A030247 A139956 this_sequence A070322 A053527 A035331
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com)
|
|
EXTENSIONS
|
Better description and more terms from Jud McCranie (j.mccranie(AT)comcast.net), Jun 16, 2000
|
|
|
Search completed in 0.002 seconds
|
