Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

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

1,1

CROSSREFS

Cf. A000292, A104246, A102795, etc.

Sequence in context: A167353 A120746 A106613 this_sequence A050692 A050693 A152246

Adjacent sequences: A102799 A102800 A102801 this_sequence A102803 A102804 A102805

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