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

A255678
Smallest number m needing exactly n distinct digits in decimal representation of m*(m+1)/2.
3
0, 4, 14, 45, 143, 452, 1431, 4549, 14334, 46097
OFFSET
1,2
COMMENTS
A118668(a(n)) = n and A118668(m) <> n for m < a(n).
PROG
(Haskell)
a255678 n = head $ filter ((== n) . a118668) [0..]
CROSSREFS
Cf. A118668, A260214 (the resulting triangular numbers).
Sequence in context: A005775 A094688 A068092 * A153480 A229007 A232060
KEYWORD
nonn,base,fini,full
AUTHOR
Reinhard Zumkeller, Jul 11 2015
STATUS
approved