|
Search: id:A064152
|
|
|
| A064152 |
|
Erdos primes: primes p such that all p-k! for 1<=k!<p are composite. |
|
+0
1
|
|
| 2, 101, 211, 367, 409, 419, 461, 557, 673, 709, 769, 937, 967, 1009, 1201, 1259, 1709, 1831, 1889, 2141, 2221, 2309, 2351, 2411, 2437, 2539, 2647, 2837, 2879, 3011, 3019, 3041, 3049, 3079, 3163, 3217, 3221, 3359, 3389, 3499, 3593, 3671, 3709, 3833, 3851
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Numbers of Erdos primes <= 10^j for j=1,2,3,.... are 1, 1, 13, 95, 901, 7875, 71140, 646242, 5901409, ... For large j the asymptotic law seems to be #E(10^j)~(1/8)*(10^j/(j*ln(10))). If so the sequence is infinite.
|
|
REFERENCES
|
R. K. Guy, Unsolved Problems in Number Theory, A16.
|
|
LINKS
|
T. D. Noe, Table of n, a(n) for n=1..7875
|
|
CROSSREFS
|
Adjacent sequences: A064149 A064150 A064151 this_sequence A064153 A064154 A064155
Sequence in context: A016034 A100669 A042249 this_sequence A088272 A125819 A072383
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Felice Russo (felice.russo(AT)katamail.com), Sep 13 2001
|
|
|
Search completed in 0.002 seconds
|
