login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

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

%S 50,69,71,81,87,90,96,99,102,109,112,115,118,133,135,143,145,149,151,

%T 154,161,164,181,187,190,197,199,206,209,212,215,218,226,228,232,235,

%U 242,243,245,251,254,257,261,263,264,266,270,273,279,281

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

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

%K nonn

%O 1,1

%A _Jud McCranie_, Feb 26 2005