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.

A002636 Number of ways of writing n as an unordered sum of at most 3 nonzero triangular numbers.

Table of values

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

List of values

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