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

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, 14367, 15946, 12983, 10879, 12798, 14695, 13429, 13822, 13821, 13820, 12439, 13697, 16879, 12698, 13946, 13694

Offset

0,1

Comments

A131364(a(n)) = n and A131364(m) <> n for m<a(n).

Links

Lars Blomberg, Table of n, a(n) for n = 0..2000

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

Sequence in context: A049223 A308282 A223512 * A048176 A127616 A277394

Adjacent sequences: A131364 A131365 A131366 * A131368 A131369 A131370

Keyword

nonn,base

Author

Reinhard Zumkeller, Jul 03 2007

Extensions

a(25)-a(40) from Lars Blomberg, May 11 2015

Status

approved