Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A102855
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A102855 Minimal number of distinct nonzero tetrahedral numbers needed to represent n, or -1 if no such representation is possible. +0
6
1, -1, -1, 1, 2, -1, -1, -1, -1, 1, 2, -1, -1, 2, 3, -1, -1, -1, -1, 1, 2, -1, -1, 2, 3, -1, -1, -1, -1, 2, 3, -1, -1, 3, 1, 2, -1, -1, 2, 3, -1, -1, -1, -1, 2, 3, -1, -1, 3, 4, -1, -1, -1, -1, 2, 1, 2, -1, 3, 2, 3, -1, -1, -1, 3, 2, 3, -1, 4, 3, 4, -1, -1, -1, -1, 2, 3, -1, -1 (list; graph; listen)
OFFSET

1,5

CROSSREFS

Cf. A104246, A102795-A102806, A102856-A102858.

Sequence in context: A107910 A085006 A033272 this_sequence A124148 A088530 A058060

Adjacent sequences: A102852 A102853 A102854 this_sequence A102856 A102857 A102858

KEYWORD

sign

AUTHOR

Jud McCranie (j.mccranie(AT)comcast.net), Mar 01 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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research