%I A136711
%S A136711 1,1,1,1,1,1,0,1,1,1,1,1,1,1,8,2,2,2,2,2,2,13,7,3,3,3,3,2,13,13,5,3,3,
               3,
%T A136711 3,14,14,13,4,4,4,4,15,15,15,12,5,5,4,15,15,15,15,10,5,5,16,16,16,16,16,
%U A136711 9,6,17,17,17,17,17,17,7,18,18,18,18,18,18,7,18,18,18,18,18,18,8,19,19
%N A136711 At step n the sequence lists the number of occurences of digit (n mod 
               k), with k>0, in all the numbers from 1 to n. Case k=7.
%e A136711 For n=15 we have 8 because the digit (15 mod 7)=1 is present 8 times: 
               1, 10, 11, 12, 13, 14, 15.
%e A136711 For n=20 we have 2 because the digit (20 mod 7)=6 is present twice: 6, 
               16.
%p A136711 P:=proc(n,m) local a,b,c,d,i,v; v:=array(1..m); for i from 1 to m-1 do 
               v[i]:=1; print(1); od; if m=10 then v[m]:=1; print(1); else v[m]:=0; 
               print(0); fi; for i from m+1 by 1 to n do a:=(i mod m); for b from 
               i-m+1 by 1 to i do d:=b; while d>0 do c:=d-(trunc(d/10)*10); d:=trunc(d/
               10); if c=a then if a=0 then v[m]:=v[m]+1; else v[a]:=v[a]+1; fi; 
               fi; od; od; if a=0 then print(v[m]); else print(v[a]); fi; od; end: 
               P(101,7);
%Y A136711 Cf. A136706, A136707, A136708, A136709, A136710, A136712, A136713, A136714.
%Y A136711 Sequence in context: A073442 A130617 A010150 this_sequence A037920 A138997 
               A133918
%Y A136711 Adjacent sequences: A136708 A136709 A136710 this_sequence A136712 A136713 
               A136714
%K A136711 easy,nonn
%O A136711 0,15
%A A136711 Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Jan 18 2008