|
| |
|
|
A079952
|
|
Number of primes p such that prime(n) mod 2*p < prime(n).
|
|
3
| |
|
|
0, 0, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 11, 12, 13, 14, 15, 15, 15, 16, 16, 16, 18, 18, 19, 19, 21, 21, 21, 22, 23, 23, 24, 24, 24, 24, 25, 25, 27, 29, 30, 30, 30, 30, 30, 30, 31, 32, 32, 32, 33, 34, 34, 34, 36, 36, 36, 37, 38, 39, 40, 40, 40, 41, 42, 42, 42
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| T(n,a(n)+1)=A000040(n), T defined as in A079950.
|
|
|
EXAMPLE
| n=6: prime(6)=13 and 13 mod(2*2)=1, 13 mod(2*3)=1, 13 mod(2*5)=3, 13 mod(2*7)=13, therefore a(6)=3.
|
|
|
CROSSREFS
| Cf. A079953, A079951.
Cf. A055930. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 15 2008]
Sequence in context: A171975 A160511 A055930 * A090638 A057363 A073869
Adjacent sequences: A079949 A079950 A079951 * A079953 A079954 A079955
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 19 2003
|
| |
|
|
