[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A374273 a(n) is the smallest number which can be represented as the sum of three distinct nonzero n-gonal numbers in exactly n ways, or -1 if no such number exists. 1
37, 161, 498, 1666, 2546, 7434, 16609, 25952, 48786, 49861, 72347, 127335, 183289, 196469, 416913, 466546, 494369, 506649, 801010, 1401011, 2372586, 1414009, 2003027, 3274986, 2927260, 2721677, 5592756, 8016592, 6632759, 7057914, 8401837, 13248146, 11648679, 8650006 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,1
LINKS
Eric Weisstein's World of Mathematics, Polygonal Number
EXAMPLE
a(3) = 37 = 1 + 15 + 21 = 3 + 6 + 28 = 6 + 10 + 21.
a(4) = 161 = 1^2 + 4^2 + 12^2 = 2^2 + 6^2 + 11^2 = 4^2 + 8^2 + 9^2 = 5^2 + 6^2 + 10^2.
CROSSREFS
Sequence in context: A140011 A296156 A250842 * A083389 A142909 A269259
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jul 02 2024
EXTENSIONS
a(21) and beyond from Michael S. Branicky, Jul 08 2024
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 23:33 EDT 2024. Contains 375520 sequences. (Running on oeis4.)