|
| |
|
|
A065685
|
|
Number of primes <= prime(n) which begin with a 6.
|
|
2
| |
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,19
|
|
|
LINKS
| Harry J. Smith, Table of n, a(n) for n=1,...,1000
|
|
|
EXAMPLE
| a(17) = 0, a(18) = 1: 61 = A000040(18) is the first prime beginning with 6. a(664579) = 72257 (A000040(664579) = 9999991 is the largest prime < 10,000,000).
|
|
|
PROG
| (PARI) digitsIn(x)= { local(d); if (x==0, return(1)); d=1 + log(x)\log(10); if (10^d == x, d++, if (10^(d-1) > x, d--)); return(d) } MSD(x)= { return(x\10^(digitsIn(x)-1)) } { a=0; p=2; for (n=1, 1000, q=prime(n); while (p <= q, if(MSD(p) == 6, a++); p=nextprime(p+1)); write("b065685.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Oct 26 2009]
|
|
|
CROSSREFS
| A065680, A000040.
Sequence in context: A044932 A065687 A077433 * A084100 A130130 A046698
Adjacent sequences: A065682 A065683 A065684 * A065686 A065687 A065688
|
|
|
KEYWORD
| base,nonn
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 13 2001
|
| |
|
|
