|
Search: id:A020498
|
|
|
| A020498 |
|
a(n) is the smallest number such that n primes occur infinitely often among (x+a(1), ...,x+a(n)). |
|
+0
4
|
|
| 1, 3, 7, 9, 13, 19, 21, 27, 31, 33, 37, 43, 49, 51, 57, 63, 69, 73, 79, 87, 91, 97, 99, 103, 111, 117, 121, 129, 133, 139, 141, 147, 153, 157, 159, 163, 169, 177, 183, 187, 189, 199, 201, 211, 213, 217, 231, 241, 243, 247, 253, 261, 267, 271, 273, 279, 283, 289
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
a(n) is the least number > a(n-1) such that a(1) through a(n) do not contain all residues modulo any prime. - David Wasserman (wasserma(AT)spawar.navy.mil), Aug 17 2005
|
|
REFERENCES
|
R. K. Guy's "Unsolved Problems in Number Theory" (2nd edition, Springer, 1994), Section A9.
|
|
CROSSREFS
|
Cf. A020497.
Adjacent sequences: A020495 A020496 A020497 this_sequence A020499 A020500 A020501
Sequence in context: A066207 A141544 A088649 this_sequence A107771 A103601 A111250
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com) and Chris Thompson (cet1(AT)cus.cam.ac.uk)
|
|
EXTENSIONS
|
More terms from David Wasserman (wasserma(AT)spawar.navy.mil), Aug 17 2005
|
|
|
Search completed in 0.002 seconds
|
