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.

A035592 Number of partitions of 3n with same number of parts == 1 (mod 3) and == 2 (mod 3).

Table of values

n a(n)
0 1
1 2
2 6
3 14
4 32
5 66
6 134
7 256
8 480
9 868
10 1540
11 2664
12 4536
13 7574
14 12474
15 20234
16 32428
17 51324
18 80388
19 124582
20 191310
21 291114
22 439394
23 657936
24 978054
25 1443684
26 2117136
27 3085174
28 4469368
29 6437742
30 9223324
31 13145792
32 18644484
33 26317916
34 36981828

List of values

[1, 2, 6, 14, 32, 66, 134, 256, 480, 868, 1540, 2664, 4536, 7574, 12474, 20234, 32428, 51324, 80388, 124582, 191310, 291114, 439394, 657936, 978054, 1443684, 2117136, 3085174, 4469368, 6437742, 9223324, 13145792, 18644484, 26317916, 36981828]