This site is supported by donations to The OEIS Foundation.

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088330 Sum of the remainders when n is divided by nonzero numbers obtained by deleting one digit. The sum ranges over all the digits. 0

%I

%S 0,0,0,1,2,0,4,3,2,1,0,1,0,3,0,1,2,7,4,3,0,1,2,0,3,2,0,3,8,3,0,1,2,4,

%T 0,1,6,8,0,5,0,1,2,5,6,0,3,3,5,9,0,1,2,3,4,5,0,5,6,9,0,1,2,4,6,5,10,0,

%U 7,9,0,1,2,5,4,5,8,10,0,9,0,1,2,3,6,5,6,13,10,0,0,3,8,16,10,5,20,14,12,24,0

%N Sum of the remainders when n is divided by nonzero numbers obtained by deleting one digit. The sum ranges over all the digits.

%C a((10^n - 1)/9) = n. for n > 2. a(1111111 n times ) = a(A000042(n)) = n, n > 2.

%C Differs from A067458 first at n=101, where A067458(101)=0 and a(101) = (101 mod 1) + (101 mod 11) + (101 mod 10)=0+2+1=3. [_R. J. Mathar_, Sep 11 2008]

%e a(1234) = Rem[1234/123] + Rem[1234/124]+ Rem[1234/134] + Rem[1234/234] = 4+ 118 + 28 + 64 = 214 where Rem [a/b] = the remainder when a is divided by b.

%Y Cf. A000042.

%K base,nonn

%O 10,5

%A _Amarnath Murthy_, Oct 01 2003

%E More terms from _Ray Chandler_, Oct 06 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.