|
| |
|
|
A067458
|
|
Sum of remainders when n is divided by its nonzero digits.
|
|
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
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 10,5
|
|
|
COMMENTS
| a(n) = 0 for 0 < n 10.
|
|
|
EXAMPLE
| a(14)= 2 as 1 divides 14 and 2 is the remainder obtained when 14 is divided by 4.
|
|
|
MATHEMATICA
| Table[Plus @@ Mod[n, Select[IntegerDigits[n], # != 0 &]], {n, 10, 100}]
|
|
|
CROSSREFS
| Sequence in context: A145382 A192423 A078909 * A088330 A122512 A128263
Adjacent sequences: A067455 A067456 A067457 * A067459 A067460 A067461
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Feb 07 2002
|
|
|
EXTENSIONS
| Edited and extended by Robert G. Wilson v (rgwv(AT)rgwv.com), Feb 11 2002
|
| |
|
|
