cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
1 5
2 11
3 14
4 21
5 24
6 30
7 36
8 39
9 45
10 55
11 57
12 60
13 66
14 76
15 85
16 88
17 91
18 94
19 104
20 119
21 121
22 124
23 130
24 140
25 155
26 166
27 169
28 175
29 176
30 185
31 200
32 204
33 221
34 224
35 230
36 240
37 249
38 255
39 276
40 285
41 287
42 290
43 296
44 304
45 306
46 321
47 340
48 342
49 365
50 368
51 370
52 374
53 384

List of values

[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]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.