The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A014836 Sum modulo n of all the digits of n in every base from 2 to n-1. 2
 2, 3, 2, 3, 1, 0, 2, 4, 1, 9, 6, 9, 14, 9, 5, 0, 14, 11, 19, 3, 20, 7, 18, 25, 5, 2, 24, 12, 5, 28, 9, 18, 0, 8, 0, 10, 26, 12, 3, 30, 21, 19, 24, 37, 27, 39, 17, 14, 36, 35, 24, 3, 32, 17, 42, 1, 47, 56, 44, 0, 11, 50, 21, 2, 55, 55, 17, 5, 61, 69, 55, 3, 14, 14, 59, 38, 22, 62 (list; graph; refs; listen; history; text; internal format)
 OFFSET 3,1 LINKS Vincenzo Librandi, Table of n, a(n) for n = 3..10000 FORMULA a(n)=A014837(n) mod n. [From R. J. Mathar, Aug 10 2008] MATHEMATICA Table[ Mod[Plus@@Table[Plus@@IntegerDigits[n, k], {k, 2, n-1}], n], {n, 3, 100}] CROSSREFS Cf. A014834, A014837, A116987. Sequence in context: A295301 A308133 A306426 * A197262 A085032 A004549 Adjacent sequences:  A014833 A014834 A014835 * A014837 A014838 A014839 KEYWORD nonn,base AUTHOR STATUS approved

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

Last modified August 8 01:39 EDT 2020. Contains 336286 sequences. (Running on oeis4.)