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.

A104246 Minimal number of tetrahedral numbers (A000292(k) = k(k+1)(k+2)/6) needed to sum to n.

Table of values

n a(n)
1 1
2 2
3 3
4 1
5 2
6 3
7 4
8 2
9 3
10 1
11 2
12 3
13 4
14 2
15 3
16 4
17 5
18 3
19 4
20 1
21 2
22 3
23 4
24 2
25 3
26 4
27 5
28 3
29 4
30 2
31 3
32 4
33 5
34 3
35 1
36 2
37 3
38 4
39 2
40 2
41 3
42 4
43 3
44 3
45 2
46 3
47 4
48 4
49 3
50 3
51 4
52 5
53 4
54 4
55 2
56 1
57 2
58 3
59 3
60 2
61 3
62 4
63 4
64 3
65 3
66 2
67 3
68 4
69 4
70 2
71 3
72 4
73 5
74 3
75 3
76 2
77 3
78 4
79 4
80 3
81 4
82 5
83 5
84 1
85 2
86 3
87 4
88 2
89 3
90 3
91 2
92 3
93 4
94 2
95 3
96 3
97 4
98 3
99 4
100 4
101 3
102 4

List of values

[1, 2, 3, 1, 2, 3, 4, 2, 3, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 1, 2, 3, 4, 2, 3, 4, 5, 3, 4, 2, 3, 4, 5, 3, 1, 2, 3, 4, 2, 2, 3, 4, 3, 3, 2, 3, 4, 4, 3, 3, 4, 5, 4, 4, 2, 1, 2, 3, 3, 2, 3, 4, 4, 3, 3, 2, 3, 4, 4, 2, 3, 4, 5, 3, 3, 2, 3, 4, 4, 3, 4, 5, 5, 1, 2, 3, 4, 2, 3, 3, 2, 3, 4, 2, 3, 3, 4, 3, 4, 4, 3, 4]