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.

A241741 Number of partitions p of n such that (number of numbers in p of form 3k+2) = (number of numbers in p of form 3k).

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 2
5 3
6 3
7 5
8 9
9 11
10 14
11 22
12 29
13 36
14 51
15 66
16 83
17 107
18 139
19 170
20 216
21 273
22 340
23 415
24 520
25 635
26 778
27 952
28 1177
29 1414
30 1724
31 2094
32 2527
33 3038
34 3691
35 4411
36 5286
37 6345
38 7586
39 9008
40 10778
41 12796
42 15163
43 17979
44 21288
45 25059
46 29608
47 34861
48 40927
49 48035

List of values

[1, 1, 1, 1, 2, 3, 3, 5, 9, 11, 14, 22, 29, 36, 51, 66, 83, 107, 139, 170, 216, 273, 340, 415, 520, 635, 778, 952, 1177, 1414, 1724, 2094, 2527, 3038, 3691, 4411, 5286, 6345, 7586, 9008, 10778, 12796, 15163, 17979, 21288, 25059, 29608, 34861, 40927, 48035]