login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A102805 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) = 6. 0

%I #5 Oct 02 2013 15:57:58

%S 126,392,402,418,439,457,464,502,538,577,587,602,612,638,657,722,793,

%T 812,822,838,863,1007,1062,1198,1408,1423

%N 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) = 6.

%C It appears that there are just two numbers n for which f(n) = 7, namely 412 and 622 and none with f(n) > 7.

%Y Cf. A000292, A104246, A102795, etc.

%K nonn

%O 1,1

%A _Jud McCranie_, Feb 26 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 12:06 EDT 2024. Contains 371792 sequences. (Running on oeis4.)