login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102801 Let f(n) be the minimal number of distinct nonzero tetrahedral numbers that add to n (or -1 if n is not a sum of distinct tetrahedral numbers); sequence gives numbers n for which f(n) = 2. 0
5, 11, 14, 21, 24, 30, 36, 39, 45, 55, 57, 60, 66, 76, 85, 88, 91, 94, 104, 119, 121, 124, 130, 140, 155, 166, 169, 175, 176, 185, 200, 204, 221, 224, 230, 240, 249, 255, 276, 285, 287, 290, 296, 304, 306, 321, 340, 342, 365, 368, 370, 374, 384 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Cf. A000292, A104246, A102795, etc.

Sequence in context: A073615 A174177 A084864 * A196206 A079030 A103011

Adjacent sequences:  A102798 A102799 A102800 * A102802 A102803 A102804

KEYWORD

nonn

AUTHOR

Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu#, Feb 26 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 03:45 EST 2012. Contains 205978 sequences.