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.

A057945 Number of triangular numbers needed to represent n with greedy algorithm.

Table of values

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

List of values

[0, 1, 2, 1, 2, 3, 1, 2, 3, 2, 1, 2, 3, 2, 3, 1, 2, 3, 2, 3, 4, 1, 2, 3, 2, 3, 4, 2, 1, 2, 3, 2, 3, 4, 2, 3, 1, 2, 3, 2, 3, 4, 2, 3, 4, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 2, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 2, 3, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 2, 3, 4, 1, 2, 3, 2, 3, 4, 2, 3, 4, 3, 2, 3, 4, 3]