|
|
A036520
|
|
Smallest triangular number containing exactly n 3's.
|
|
1
|
|
|
3, 3003, 33153, 3303735, 333336, 333039336, 13333363350, 330335331336, 3033333513330, 303313733373336, 30333330330333465, 313631353332333336, 330332337333331336, 3333043333303433331, 3333333330453337336653, 30733333373333335323321, 330332334339335333331336, 33033333933433336339893330
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
nsmall = Table[Infinity, 20];
For[i = 0, i <= 10^6, i++, p = PolygonalNumber[i];
n0 = Count[IntegerDigits[p], 3];
If[nsmall[[n0]] > p, nsmall[[n0]] = p]];
ReplaceAll[nsmall, Infinity -> "?"] (* Robert Price, Mar 22 2020 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|