|
Search: id:A111181
|
|
| |
|
| 2, 2, 3, 5, 8, 10, 13, 15, 19, 25, 26, 32, 35, 37, 41, 47, 52, 54, 59, 63, 65, 71, 74, 80, 88, 92, 94, 98, 99, 103, 116, 120, 126, 128, 138, 140, 145, 151, 155, 161, 166, 168, 177, 179, 183, 185, 196, 208, 212, 214, 218, 224, 225, 235, 241, 247, 253, 255, 260, 264
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Conjecture: There will always be an x such that a(x+1) - a(x) = k for k=1,2.. However, x becomes large when k > 70.
|
|
FORMULA
|
Prime(x) = the x-th prime. Pi(x) = number of primes <= x
|
|
PROGRAM
|
(PARI) primexmpix(n, k) = { local(x, y, z); for(x=1, n, y=prime(x)-primepi(x); z=prime(x+1)-primepi(x+1); if(z-y == k, print1(y", ") ) ) }
|
|
CROSSREFS
|
Sequence in context: A126024 A127678 A114990 this_sequence A076777 A111123 A087729
Adjacent sequences: A111178 A111179 A111180 this_sequence A111182 A111183 A111184
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cino Hilliard (hillcino368(AT)gmail.com), Oct 22 2005
|
|
|
Search completed in 0.002 seconds
|
