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.

A256587 Number of ways to write n = r + s + t, where r,s,t are elements of the set {floor(k*(k+1)/4): k = 1,2,3,...} with s odd and r <= s <= t.

Table of values

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

List of values

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