|
|
A046719
|
|
Total number of digits in all primes with n digits.
|
|
1
|
|
|
4, 42, 429, 4244, 41815, 413436, 4102567, 40775008, 405774711, 4042049770, 40293025322, 401878286460, 4009949122673, 40024266995482, 399594430078005, 3990300329780096, 39853419882545236, 398095148341559286, 3977036546783471193
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
There are 21 2-digit primes, so a(2)=2*21=42.
|
|
MATHEMATICA
|
Flatten[Table[n*Differences[PrimePi[{10^(n - 1), 10^n}]], {n, 13}]] (* Jayanta Basu, Jun 27 2013 *)
With[{nn=14}, Differences[PrimePi[10^Range[0, nn]]]*Range[nn]] (* This program generates only the first 14 terms of the sequence; Mathematica's PrimePi function cannot generate the 15th or higher terms *) (* Harvey P. Dale, Apr 22 2016 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|