A102801 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) = 2.

5, 11, 14, 21, 24, 30, 36, 39, 45, 55, 57, 60, 66, 76, 85, 88, 91, 94, 104, 119, 121, 124, 130, 140, 155, 166, 169, 175, 176, 185, 200, 204, 221, 224, 230, 240, 249, 255, 276, 285, 287, 290, 296, 304, 306, 321, 340, 342, 365, 368, 370, 374, 384

Offset: 1

Author

Jud McCranie, Feb 26 2005

Keywords

• nonn

Examples

			680 (of A034404) is a sum of two distinct positive tetrahedral numbers but not in the list because it is also a tetrahedral number itself. - _R. J. Mathar_, Jun 05 2025
		

Links

• R. J. Mathar, Table of n, a(n) for n = 1..966

Crossrefs

Cf. A000292, A104246, A102795, etc.