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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102802 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) = 3. 0
15, 25, 31, 34, 40, 46, 49, 59, 61, 65, 67, 70, 77, 80, 86, 89, 92, 95, 98, 101, 105, 108, 111, 114, 123, 125, 129, 131, 134, 139, 141, 144, 150, 156, 159, 160, 170, 177, 179, 180, 186, 189, 195, 196, 201, 205, 208, 210, 211, 214, 222, 225, 231 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

CROSSREFS

Cf. A000292, A104246, A102795, etc.

Sequence in context: A120746 A106613 A192542 * A050692 A050693 A200046

Adjacent sequences:  A102799 A102800 A102801 * A102803 A102804 A102805

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 15 21:16 EST 2012. Contains 205856 sequences.