login
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

%I #10 Oct 10 2019 11:49:12

%S 12,13,15,17,21,1113,1117,1119,1213,1219,1113,1317,1114,1314,1417,

%T 1315,1519,1116,1617,1117,1317,1719,1318,1819,1719,1021,101113,101117,

%U 101119,2113,111217,2113,111317,111319,111419,2115,111517,111316,111617,111317

%N 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.

%H Reinhard Zumkeller, <a href="/A127354/b127354.txt">Table of n, a(n) for n = 1..10000</a>

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

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

%o (Haskell)

%o a127354 = a047842 . a000040 -- _Reinhard Zumkeller_, Apr 14 2014

%Y Cf. A047842, A000040, A127355.

%K nonn,base

%O 1,1

%A _Lekraj Beedassy_, Jan 11 2007