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

A374194
a(n) is the smallest number which can be represented as the sum of two nonzero hexagonal pyramidal numbers in exactly n ways, or -1 if no such number exists.
2
2, 5972, 5170425
OFFSET
1,1
COMMENTS
There are no further positive terms <= 10^15. - Michael S. Branicky, Jun 30 2024
LINKS
Eric Weisstein's World of Mathematics, Hexagonal Pyramidal Number
EXAMPLE
a(2) = 5972 = 1222 + 4750 = 1925 + 4047.
CROSSREFS
KEYWORD
nonn,hard,more,bref
AUTHOR
Ilya Gutkovskiy, Jun 30 2024
STATUS
approved