A070635 a(n) = n mod (sum of digits of n).

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 4, 3, 2, 1, 0, 9, 0, 0, 2, 3, 0, 4, 2, 0, 8, 7, 0, 3, 2, 3, 6, 3, 0, 7, 5, 3, 0, 1, 0, 1, 4, 0, 6, 3, 0, 10, 0, 3, 3, 5, 0, 5, 1, 9, 6, 3, 0, 5, 6, 0, 4, 10, 6, 2, 12, 9, 0, 7, 0, 3, 8, 3, 11, 7, 3, 15, 0, 0, 2, 6, 0, 7, 2, 12, 8

Offset

1,14

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Formula

a(A005349(n)) = 0. - Reinhard Zumkeller, Mar 10 2008

A188641(n) = A000007(a(n)); a(A065877(n)) > 0. - Reinhard Zumkeller, Apr 07 2011

a(A138791(n)) = n and a(m) <> n for m < A138791(n). - Reinhard Zumkeller, Nov 07 2011

Mathematica

Table[Mod[n, Total[IntegerDigits[n]]], {n, 100}] (* Harvey P. Dale, Mar 11 2013 *)

Prog

(Haskell)
a070635 n = n `mod` (a007953 n)
-- Reinhard Zumkeller, Apr 07 2011
(PARI) a(n) = n % sumdigits(n); \\ Michel Marcus, Dec 30 2015
(Magma) [n mod (&+Intseq(n)): n in [1..100]]; // Vincenzo Librandi, Dec 30 2015

Crossrefs

Cf. A007953.

Cf. A199238.

Sequence in context: A307335 A030586 A249345 * A110366 A284801 A090284

Adjacent sequences: A070632 A070633 A070634 * A070636 A070637 A070638

Keyword

nonn,base

Author

Reinhard Zumkeller, May 13 2002

Status

approved