|
Search: id:A119291
|
|
|
| A119291 |
|
Total number of zero digits in first 10^n primes. |
|
+0
10
|
| |
|
|
OFFSET
|
1,2
|
|
|
FORMULA
|
Count the number of zero digits in 10^n primes
a(n)= sum( A055641(A000040(j)),j=1..10^n) - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 30 2008
|
|
EXAMPLE
|
a(1)=9 since there are 9 zero digits in the first 100 primes.
|
|
MAPLE
|
A055641 := proc(n) local a, d ; a := 0 ; for d in convert(n, base, 10) do if d = 0 then a := a+1 ; fi ; od: a ; end: p := 2: n := 1: c :=0 : nsw := 10 : while true do n := n+1 ; p := nextprime(p) ; c := c+A055641(p) ; if n = nsw then print(c) ; nsw := 10*nsw ; fi ; od: # R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 30 2008
|
|
CROSSREFS
|
Cf. A119290, A119292-A119300.
Adjacent sequences: A119288 A119289 A119290 this_sequence A119292 A119293 A119294
Sequence in context: A033713 A067422 A113564 this_sequence A113269 A116877 A081020
|
|
KEYWORD
|
more,nonn,base
|
|
AUTHOR
|
Enoch Haga (Enokh(AT)comcast.net), May 13 2006
|
|
|
Search completed in 0.002 seconds
|
