|
Search: id:A098592
|
|
|
| A098592 |
|
Number of primes between n*30 and (n+1)*30. |
|
+0
2
|
|
| 10, 7, 7, 6, 5, 6, 5, 6, 5, 5, 4, 6, 5, 4, 6, 5, 5, 2, 5, 5, 5, 6, 4, 4, 4, 5, 3, 6, 4, 4, 4, 4, 4, 5, 5, 4, 6, 3, 3, 4, 5, 4, 4, 6, 2, 3, 3, 5, 4, 7, 2, 5, 4, 6, 3, 4, 4, 3, 4, 4, 3, 2, 7, 3, 3, 3, 5, 5, 3, 5, 3, 5, 2, 3, 4, 4, 5, 3, 4, 7, 3, 4, 3, 1, 5, 3, 3, 3, 4, 7, 5, 4, 3, 5, 3, 4, 4, 3, 4, 2, 4, 3, 5, 2, 2, 3
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
Number of nonzero bits in A098591(n).
The number a(n) is < 8 except for n=0. - Pierre CAMI (pierre-cami(AT)orange.fr), Jun 02 2009
Conjecture: if n tends to infinity a(n) may be > 1 and = 2 or 3 or 4 or 5 or 6 or 7. - Pierre CAMI (pierre-cami(AT)orange.fr), Jun 02 2009
The probability for a(n) to be > 1 decreases as n increases. - Pierre CAMI (pierre-cami(AT)orange.fr), Jun 02 2009
|
|
EXAMPLE
|
a(1)=7 because there are 7 primes in the interval (30,60): 31,37,41,43,47,53,59. a(26)=3 because the interval of length 30 following 26*30=780 contains 3 primes: 787, 797 and 809.
|
|
PROGRAM
|
See links given in A098591.
|
|
CROSSREFS
|
Cf. A000040 prime numbers, A098591 packed representation of the primes mod 30.
Sequence in context: A012869 A079166 A089245 this_sequence A016731 A068444 A038309
Adjacent sequences: A098589 A098590 A098591 this_sequence A098593 A098594 A098595
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Sep 16 2004
|
|
EXTENSIONS
|
Edited by N. J. A. Sloane, Jun 12 2009 at the suggestion of R. J. Mathar
|
|
|
Search completed in 0.002 seconds
|
