id:A014836 - OEIS Search Results

Search: id:A014836

Displaying 1-1 of 1 results found.

page 1

Sum modulo n of all the digits of n in every base from 2 to n-1.

+0
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; listen)

	OFFSET	`3,1`
	FORMULA	`a(n)=A014837(n) mod n. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), 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.` `Adjacent sequences: A014833 A014834 A014835 this_sequence A014837 A014838 A014839` `Sequence in context: A123703 A105436 A059905 this_sequence A085032 A004549 A026600`
	KEYWORD	`nonn`
	AUTHOR	`Olivier Gerard (olivier.gerard(AT)gmail.com)`

page 1

Search completed in 0.002 seconds

Last modified October 12 15:26 EDT 2008. Contains 144830 sequences.

AT&T Labs Research