Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102803
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102803 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) = 4. +0
1
50, 69, 71, 81, 87, 90, 96, 99, 102, 109, 112, 115, 118, 133, 135, 143, 145, 149, 151, 154, 161, 164, 181, 187, 190, 197, 199, 206, 209, 212, 215, 218, 226, 228, 232, 235, 242, 243, 245, 251, 254, 257, 261, 263, 264, 266, 270, 273, 279, 281 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Cf. A000292, A104246, A102795, etc.

Sequence in context: A007692 A025285 A092541 this_sequence A039473 A146170 A071366

Adjacent sequences: A102800 A102801 A102802 this_sequence A102804 A102805 A102806

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research