A131367 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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

(list; graph; refs; listen; history; text; internal format)

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.