login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A127354
Digit count of prime(n). The digit count numerically summarizes the frequency of digits 0 through 9 in that order when they occur in a number.
3
12, 13, 15, 17, 21, 1113, 1117, 1119, 1213, 1219, 1113, 1317, 1114, 1314, 1417, 1315, 1519, 1116, 1617, 1117, 1317, 1719, 1318, 1819, 1719, 1021, 101113, 101117, 101119, 2113, 111217, 2113, 111317, 111319, 111419, 2115, 111517, 111316, 111617, 111317
OFFSET
1,1
LINKS
FORMULA
a(n) = A047842(A000040(n)).
MATHEMATICA
dc[n_] :=FromDigits@Flatten@Select[Table[{DigitCount[n, 10, k], k}, {k, 0, 9}], #[[1]] > 0 &]; Table[dc[Prime[n]], {n, 40}] (* Ray Chandler, Jan 16 2007 *)
PROG
(Haskell)
a127354 = a047842 . a000040 -- Reinhard Zumkeller, Apr 14 2014
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Lekraj Beedassy, Jan 11 2007
STATUS
approved