|
| |
|
|
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
| |
|
|
126, 392, 402, 418, 439, 457, 464, 502, 538, 577, 587, 602, 612, 638, 657, 722, 793, 812, 822, 838, 863, 1007, 1062, 1198, 1408, 1423
(list; graph; refs; listen; history; internal format)
|
| |
| |
|
|
