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.

A035361 Number of partitions of n into parts 3k or 3k+2.

Table of values

n a(n)
0 1
1 0
2 1
3 1
4 1
5 2
6 3
7 2
8 5
9 5
10 6
11 9
12 11
13 11
14 18
15 19
16 23
17 31
18 36
19 40
20 56
21 60
22 73
23 92
24 105
25 121
26 155
27 170
28 204
29 247
30 280
31 325
32 397
33 440
34 521
35 615
36 695
37 805
38 954
39 1063
40 1244
41 1442
42 1626
43 1873
44 2176
45 2431
46 2813
47 3221
48 3623
49 4146
50 4751
51 5309
52 6086
53 6905
54 7746
55 8807

List of values

[1, 0, 1, 1, 1, 2, 3, 2, 5, 5, 6, 9, 11, 11, 18, 19, 23, 31, 36, 40, 56, 60, 73, 92, 105, 121, 155, 170, 204, 247, 280, 325, 397, 440, 521, 615, 695, 805, 954, 1063, 1244, 1442, 1626, 1873, 2176, 2431, 2813, 3221, 3623, 4146, 4751, 5309, 6086, 6905, 7746, 8807]