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.

A035536 Number of partitions of n with equal number of parts congruent to each of 1 and 2 (mod 3).

Table of values

n a(n)
0 1
1 0
2 0
3 2
4 0
5 0
6 6
7 0
8 0
9 14
10 0
11 0
12 32
13 0
14 0
15 66
16 0
17 0
18 134
19 0
20 0
21 256
22 0
23 0
24 480
25 0
26 0
27 868
28 0
29 0
30 1540
31 0
32 0
33 2664
34 0
35 0
36 4536
37 0
38 0
39 7574
40 0
41 0
42 12474
43 0
44 0
45 20234
46 0
47 0
48 32428
49 0
50 0
51 51324
52 0
53 0
54 80388
55 0
56 0
57 124582
58 0
59 0
60 191310
61 0
62 0
63 291114
64 0
65 0
66 439394
67 0
68 0
69 657936
70 0
71 0

List of values

[1, 0, 0, 2, 0, 0, 6, 0, 0, 14, 0, 0, 32, 0, 0, 66, 0, 0, 134, 0, 0, 256, 0, 0, 480, 0, 0, 868, 0, 0, 1540, 0, 0, 2664, 0, 0, 4536, 0, 0, 7574, 0, 0, 12474, 0, 0, 20234, 0, 0, 32428, 0, 0, 51324, 0, 0, 80388, 0, 0, 124582, 0, 0, 191310, 0, 0, 291114, 0, 0, 439394, 0, 0, 657936, 0, 0]