login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070635 a(n) = n mod (sum of digits of n). 14
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,14
LINKS
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
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, May 13 2002
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 19:56 EDT 2024. Contains 371916 sequences. (Running on oeis4.)