id:A131367 - OEIS Search Results

Search: id:A131367

Displaying 1-1 of 1 results found.

page 1

Smallest number that can be written in exactly n ways as a sum of distinct repdigits of its decimal digits.

+0
2

10, 1, 197, 1198, 1098, 1236, 1235, 1492, 1384, 1576, 1976, 4713, 1347, 7514, 3712, 7641, 8716, 11967, 5614, 12377, 3912, 12337, 10978, 3821, 3812 (list; graph; listen)

	OFFSET	`0,1`
	COMMENT	`A131364(a(n)) = n and A131364(m) <> n for m<a(n).`
	LINKS	`Eric Weisstein's World of Mathematics, Repdigit`
	EXAMPLE	`a(2)=197: A131364(197)=#{111+77+9,99+77+11+9+1}=2;` `a(3)=1298:` `A131364(1298)=#{1111+99+88,999+111+99+88+1,888+222+99+88+1}=3.`
	CROSSREFS	`Adjacent sequences: A131364 A131365 A131366 this_sequence A131368 A131369 A131370` `Sequence in context: A051523 A048882 A049223 this_sequence A048176 A127616 A071938`
	KEYWORD	`nonn,base,more`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 03 2007`

page 1

Search completed in 0.002 seconds

Last modified October 6 12:54 EDT 2008. Contains 144667 sequences.

AT&T Labs Research