Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088330
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
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, 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, 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 (list; graph; listen)
OFFSET

10,5

COMMENT

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

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. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 11 2008]

EXAMPLE

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.

CROSSREFS

Cf. A000042.

Adjacent sequences: A088327 A088328 A088329 this_sequence A088331 A088332 A088333

Sequence in context: A133168 A078909 A067458 this_sequence A122512 A128263 A140254

KEYWORD

base,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Oct 01 2003

EXTENSIONS

More terms from Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 06 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.


AT&T Labs Research