id:A110366 - OEIS Search Results

Search: id:A110366

Displaying 1-1 of 1 results found.

page 1

n mod s(n), where s(n) is the sum of the digits of n.

+0
2

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, 4, 0, 1, 4, 9, 3, 11, 6, 1, 13, 9, 0, 1, 0, 3, 4, 3, 1, 3, 0, 9, 0 (list; graph; listen)

	OFFSET	`10,5`
	EXAMPLE	`a(125) = 125 (mod 8) = 5. a(5678) = 5678 mod (26)=10.` `a(19) = 19 (mod 10) = 9; a(125) = 125 (mod 8) = 5; a(5678) = 5678 mod (26)=10.`
	MAPLE	`a:=proc(n) local nn, s: nn:=convert(n, base, 10): s:=sum(nn[j], j=1..nops(nn)): n mod s end: seq(a(n), n=10..125); (Deutsch)`
	CROSSREFS	`Cf. A047892, A110365.` `Sequence in context: A071692 A030586 A070635 this_sequence A090284 A093580 A106655` `Adjacent sequences: A110363 A110364 A110365 this_sequence A110367 A110368 A110369`
	KEYWORD	`base,easy,nonn`
	AUTHOR	`Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jul 24 2005`
	EXTENSIONS	`Corrected and extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 28 2005`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.

AT&T Labs Research