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.

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

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 2
6 2
7 3
8 6
9 7
10 10
11 17
12 18
13 27
14 36
15 44
16 61
17 76
18 93
19 124
20 151
21 193
22 241
23 297
24 369
25 462
26 558
27 707
28 850
29 1044
30 1281
31 1561
32 1884
33 2323
34 2761
35 3367
36 4050
37 4857
38 5826
39 7024
40 8307
41 9982
42 11840
43 14058
44 16684
45 19785
46 23265
47 27585
48 32379
49 38125
50 44760

List of values

[1, 0, 1, 0, 2, 2, 3, 6, 7, 10, 17, 18, 27, 36, 44, 61, 76, 93, 124, 151, 193, 241, 297, 369, 462, 558, 707, 850, 1044, 1281, 1561, 1884, 2323, 2761, 3367, 4050, 4857, 5826, 7024, 8307, 9982, 11840, 14058, 16684, 19785, 23265, 27585, 32379, 38125, 44760]