|
%I #11 Jul 27 2017 04:18:26
%S 0,1,0,3,2,3,2,3,2,3,0,1,3,0,4,5,3,4,5,3,0,1,2,4,0,5,6,7,4,5,0,1,3,5,
%T 5,0,6,7,8,9,0,1,2,3,6,6,0,7,8,9,0,1,3,4,7,7,7,0,8,9,0,1,2,5,4,8,8,8,
%U 0,9,0,1,3,3,5,9,9,9,9,0,0,0,0,1,2,0,4,3,2,1,0,0,1,2,3,1,5,4,3,2,0,1,0,1,0
%N Let n = abcd...; a,b,c,d,... are digits of n. Define f(a) = bcd..., f(b) = acd..., f(c) = abd... and f(d) = abc..., i.e., f(i) = number obtained by deleting the digit i from n. Then a(n) = Sum f(i) mod i, where i ranges over all the nonzero digits of n.
%C a(k) = 0 for k < 11 and a(k) = 1 for 11 < k < 20.
%e a(23) = 3 mod 2 + 2 mod 3 = 1 + 2 = 3.
%e a(256) = 56 mod 2 + 26 mod 5 + 25 mod 6 =0 + 1 + 1 = 2.
%K base,nonn,uned
%O 20,4
%A _Amarnath Murthy_, Jun 06 2004
%E More terms from _Max Alekseyev_, Apr 26 2010
|
