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

A363253
a(n) is the smallest n-gonal number which can be represented as the sum of distinct nonzero n-gonal numbers in exactly n ways, or -1 if no such number exists.
0
OFFSET
3,1
COMMENTS
a(8) = 736, a(9) = 969.
LINKS
Eric Weisstein's World of Mathematics, Polygonal Number
EXAMPLE
For n = 3: 1 + 6 + 21 = 3 + 10 + 15 = 28.
CROSSREFS
KEYWORD
nonn,bref,more,hard
AUTHOR
Ilya Gutkovskiy, May 23 2023
STATUS
approved