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.

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

Author

Lekraj Beedassy, Jan 11 2007

Keywords

• nonn
• base

Links

• Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A047842, A000040, A127355.

Programs

Haskell

a127354 = a047842 . a000040  -- Reinhard Zumkeller, Apr 14 2014

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 *)

Formula

a(n) = A047842(A000040(n)).