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!)
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 (list; graph; refs; listen; history; text; internal format)
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
Sequence in context: A367868 A372814 A299036 * A112905 A293459 A058275
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jun 28 2024
EXTENSIONS
a(9)-a(27) from Michael S. Branicky, Jun 29 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 19 17:46 EDT 2024. Contains 375310 sequences. (Running on oeis4.)