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.

A102855 Minimal number of distinct nonzero tetrahedral numbers needed to represent n, or -1 if no such representation is possible.

Table of values

n a(n)
1 1
2 -1
3 -1
4 1
5 2
6 -1
7 -1
8 -1
9 -1
10 1
11 2
12 -1
13 -1
14 2
15 3
16 -1
17 -1
18 -1
19 -1
20 1
21 2
22 -1
23 -1
24 2
25 3
26 -1
27 -1
28 -1
29 -1
30 2
31 3
32 -1
33 -1
34 3
35 1
36 2
37 -1
38 -1
39 2
40 3
41 -1
42 -1
43 -1
44 -1
45 2
46 3
47 -1
48 -1
49 3
50 4
51 -1
52 -1
53 -1
54 -1
55 2
56 1
57 2
58 -1
59 3
60 2
61 3
62 -1
63 -1
64 -1
65 3
66 2
67 3
68 -1
69 4
70 3
71 4
72 -1
73 -1
74 -1
75 -1
76 2
77 3
78 -1
79 -1

List of values

[1, -1, -1, 1, 2, -1, -1, -1, -1, 1, 2, -1, -1, 2, 3, -1, -1, -1, -1, 1, 2, -1, -1, 2, 3, -1, -1, -1, -1, 2, 3, -1, -1, 3, 1, 2, -1, -1, 2, 3, -1, -1, -1, -1, 2, 3, -1, -1, 3, 4, -1, -1, -1, -1, 2, 1, 2, -1, 3, 2, 3, -1, -1, -1, 3, 2, 3, -1, 4, 3, 4, -1, -1, -1, -1, 2, 3, -1, -1]