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

A374141
a(n) is the smallest number which can be represented as the sum of two distinct nonzero hexagonal numbers in exactly n ways, or -1 if no such number exists.
5
7, 384, 4995, 51106, 204805, 483031, 2443431, 4674256, 10476781, 17272531, 25600656, 60765331, 90406956, 206602126, 332808531, 481676406, 303826656, 435211156, 789949306, 1406495106, 2260173906, 2704798281, 3220562556, 4435869181, 5165053156, 5309576106, 9818788281
OFFSET
1,1
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..39
Eric Weisstein's World of Mathematics, Hexagonal Number
EXAMPLE
a(2) = 384 = 6 + 378 = 153 + 231.
PROG
(Python) # see linked program
CROSSREFS
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jun 28 2024
EXTENSIONS
a(9)-a(27) from Michael S. Branicky, Jun 29 2024
STATUS
approved