|
%I #6 Sep 05 2013 11:15:42
%S 0,0,0,0,0,0,0,0,0,0,10,1,0,0,0,0,0,0,0,0,19,3,0,1,0,0,0,0,0,1,25,5,1,
%T 1,0,2,0,0,0,1,29,8,3,2,0,2,0,0,1,2,32,9,7,3,0,2,0,1,1,3,34,11,8,6,1,
%U 2,1,1,2,3,34,16,10,8,2,2,2,1,3,3,35,19,13,12,2,3,2,1,3,4,35,23,17,16,3,4,3
%N a(n) = number of times the digit congruent to n mod 10 has appeared in the sequence.
%e a(21) = 3 because the digit '1' which is congruent to 21 mod 10 has appeared 3 times in the sequence prior to this term.
%K base,nonn
%O 0,11
%A _Andrew Weimholt_, Jun 19 2005
|
