|
|
A036518
|
|
Smallest triangular number containing exactly n 1's.
|
|
1
|
|
|
1, 171, 1711, 105111, 1188111, 18111171, 1111160511, 11161151121, 111111101310, 11311511141161, 121111912011111, 11111811011411671, 11101111131911151, 11111111111113201, 111111312111373411111, 1119711111215111121171, 111112117111126711111195, 1141011111112731111616111
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
nsmall = Table[Infinity, 20];
For[i = 0, i <= 10^6, i++, p = PolygonalNumber[i];
n0 = Count[IntegerDigits[p], 1];
If[nsmall[[n0]] > p, nsmall[[n0]] = p]];
ReplaceAll[nsmall, Infinity -> "?"] (* Robert Price, Mar 22 2020 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|