id:A037478 - OEIS Search Results

Search: id:A037478

Displaying 1-1 of 1 results found.

page 1

Number of positive solutions to "numbers that are n times sum of their digits".

+0
3

9, 1, 1, 4, 1, 1, 4, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 11, 1, 1, 3, 1, 1, 3, 2, 2, 12, 1, 1, 3, 1, 1, 4, 1, 2, 15, 2, 1, 4, 1, 1, 3, 1, 1, 13, 2, 2, 3, 1, 1, 4, 1, 1, 13, 1, 1, 2, 1, 1, 3, 0, 0, 7, 0, 1, 4, 1, 1, 4, 1, 1, 8, 1, 0, 3, 1, 1, 4, 1, 1, 10, 1, 0, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 0, 1, 3, 1, 1, 9, 1 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`It appears that the largest terms occur when n=1 mod 9 and moderately large terms when n=4 or 7 mod 9.`
	EXAMPLE	`a(13)=3 since the only three solutions are 117=913, 156=1213 and 195=15*13`
	CROSSREFS	`Cf. A057147, A003634, A005349, A052489, A052490, A003635.` `Sequence in context: A068452 A010163 A109012 this_sequence A010162 A072224 A085660` `Adjacent sequences: A037475 A037476 A037477 this_sequence A037479 A037480 A037481`
	KEYWORD	`base,nonn`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), Sep 12 2000`

page 1

Search completed in 0.002 seconds

Last modified July 26 23:19 EDT 2008. Contains 142293 sequences.

AT&T Labs Research