login

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”).

A336759
a(n) is the smallest positive number that is the sum of no fewer than n distinct repdigits.
0
1, 10, 21, 309, 2108, 21996, 220884, 2111105, 21866660
OFFSET
1,2
COMMENTS
Conjecture: the sequence is infinite.
EXAMPLE
10 is the sum of 2 distinct repdigits: 9 + 1
21 is the sum of 3 distinct repdigits: 11 + 9 + 1
309 is the sum of 4 distinct repdigits: 222 + 77 + 9 + 1
2108 is the sum of 5 distinct repdigits: 1111 + 888 + 99 + 9 + 1
All numbers less than 10 can be summed with less than 2 distinct repdigits.
All numbers less than 21 can be summed with less than 3 distinct repdigits.
CROSSREFS
Sequence in context: A041833 A153317 A110418 * A368635 A336748 A041198
KEYWORD
nonn,base,more
AUTHOR
Falcon Shapiro, Aug 03 2020
EXTENSIONS
a(7)-a(9) from Sean A. Irvine, Aug 29 2020
STATUS
approved