cp's OEIS Frontend

A100910 Table of number of occurrences in n of each decimal digit from 0 to 9.

%I A100910 #34 Jul 16 2025 17:53:03
%S A100910 1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
%T A100910 0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,
%U A100910 0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,1,1,0,0,0
%N A100910 Table of number of occurrences in n of each decimal digit from 0 to 9.
%C A100910 Each row of this table has length 10 and corresponds to one term of A100909. n = 0 is normally represented as the single digit 0, so the first row here is 1, 0, 0, 0, 0, 0, 0, 0, 0, 0.
%H A100910 Robert Israel, <a href="/A100910/b100910.txt">Table of n, a(n) for n = 0..10009</a> (rows 0 to 1000, flattened)
%F A100910 From _Robert Israel_, Jul 08 2016: (Start)
%F A100910 a(n,k) = a(A059995(n),k) + (1 if A010879(n)=k, otherwise 0).
%F A100910 G.f. g(x,y) satisfies g(x,y) = ((1-x^10)/(1-x))*g(x^10,y) + (x^10-x)/(1-x) + x^10/(1-x^10) + x*y*(1-x^9*y^9)/((1-x^10)*(1-x*y)). (End)
%p A100910 seq(seq(numboccur(k, convert(n,base,10)),k=0..9),n=0..100); # _Robert Israel_, Jul 08 2016
%t A100910 A100910row[n_] := RotateRight[DigitCount[n]];
%t A100910 Array[A100910row, 10, 0] (* _Paolo Xausa_, Jul 16 2025 *)
%o A100910 (PARI) T(n, k) = #select(x->x==k, digits(n))+!(n+k); \\ _Jinyuan Wang_, Mar 01 2020
%Y A100910 Cf. A100909 (similar but each row of A100910 provides one A100909 term).
%Y A100910 Cf. A055642 (row sums), A055641 (column 0), A268643 (column 1), A316863 (column 2), A316864 (column 3), A316865 (column 4), A316866 (column 5), A316867 (column 6), A316868 (column 7), A316869 (column 8), A102683 (column 9).
%Y A100910 Cf. A059995, A010879.
%K A100910 nonn,base,easy,tabf
%O A100910 0,112
%A A100910 _Rick L. Shepherd_, Nov 21 2004