|
%I #3 Mar 30 2012 18:51:06
%S 0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0,1,1,0,1,0,
%T 1,0,1,0,1,0,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,
%U 0,1,1,0,1,0,1,0,1,0,1,0,0,1,0,1,0,1,0,1,0,1,1,0,1,0,1,0,1,0,1,0,1,2,0,1,2
%N (sum of digits) mod (number of digits) of n in decimal representation.
%C a(n) = A007953(n) mod A055642(n);
%C a(A061383(n)) = 0; a(A180157(n)) > 0;
%C a(repdigits)=0: a(A010785(n))=0: a(A002275(n))=0: a(A002276(n))=0: a(A002277(n))=0: a(A002278(n))=0: a(4(n))=0: a(A002279(n))=0: a(A002280(n))=0: a(A002281(n))=0: a(A002282(n))=0: a(A002283(n))=0;
%C A123522 gives smallest m such that a(m) = n.
%H R. Zumkeller, <a href="/A180160/b180160.txt">Table of n, a(n) for n = 0..25000</a>
%K base,nonn
%O 0,102
%A _Reinhard Zumkeller_, Aug 15 2010
|
