A095206 Let n = d(1),d(2),...,d(m) be the decimal representation of n and f(k) be the number obtained by deleting all occurrences of digit k from n, then a(n) = Sum_{k=1..m, d(k)!=0} f(d(k)) mod d(k).

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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

Offset

1,23

Links

Table of n, a(n) for n=1..87.

Example

a(23) = 3 mod 2 + 2 mod 3 = 1 + 2 = 3.
a(256) = 56 mod 2 + 26 mod 5 + 25 mod 6 =0 + 1 + 1 = 2.

Crossrefs

Sequence in context: A363348 A245219 A097509 * A344129 A308006 A049071

Adjacent sequences: A095203 A095204 A095205 * A095207 A095208 A095209

Keyword

base,nonn

Author

Amarnath Murthy, Jun 06 2004

Extensions

More terms from Max Alekseyev, Apr 26 2010

Edited by Sean A. Irvine, Apr 29 2026

Status

approved