Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102801
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
1
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; listen)
OFFSET

1,1

CROSSREFS

Cf. A000292, A104246, A102795, etc.

Sequence in context: A032481 A073615 A084864 this_sequence A079030 A103011 A137002

Adjacent sequences: A102798 A102799 A102800 this_sequence A102802 A102803 A102804

KEYWORD

nonn

AUTHOR

Jud McCranie (j.mccranie(AT)comcast.net#, Feb 26 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research