%I A053837
%S A053837 0,1,2,3,4,5,6,7,8,9,1,2,3,4,5,6,7,8,9,0,2,3,4,5,6,7,8,9,0,1,3,4,5,6,7,
%T A053837 8,9,0,1,2,4,5,6,7,8,9,0,1,2,3,5,6,7,8,9,0,1,2,3,4,6,7,8,9,0,1,2,3,4,5,
%U A053837 7,8,9,0,1,2,3,4,5,6,8,9,0,1,2,3,4,5,6,7,9,0,1,2,3,4,5,6,7,8,1,2,3,4,5
%N A053837 Sum of digits of n modulo 10.
%F A053837 a(n) =A010879(A007953(n)) =(n+a(floor[n/10])) mod 10. So can construct 
               sequence by starting with 0 and mapping 0->0123456789, 1->1234567890, 
               2->2345678901 etc. (e.g. 0, 0123456789, 0123456789123456789023456789013456789012456..., 
               etc.) and looking at n-th digit of a term with sufficient digits.
%e A053837 a(59)=4 because 5+9 = 14 = 4 mod 10
%Y A053837 Cf. A000120, A007953, A010060, A053838-A053844.
%Y A053837 Sequence in context: A032762 A071650 A037265 this_sequence A128244 A010888 
               A131650
%Y A053837 Adjacent sequences: A053834 A053835 A053836 this_sequence A053838 A053839 
               A053840
%K A053837 base,nonn
%O A053837 0,3
%A A053837 Henry Bottomley (se16(AT)btinternet.com), Mar 28 2000