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.

A241739 Number of partitions p of n such that (number of numbers in p of form 3k+1) > (number of numbers in p of form 3k+2).

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 3
5 3
6 3
7 8
8 9
9 10
10 20
11 24
12 27
13 49
14 58
15 69
16 109
17 132
18 153
19 234
20 279
21 331
22 469
23 565
24 662
25 918
26 1093
27 1290
28 1723
29 2056
30 2411
31 3165
32 3751
33 4411
34 5656
35 6700
36 7839
37 9932
38 11707
39 13699
40 17084
41 20099
42 23441
43 28939
44 33914
45 39498
46 48236
47 56392
48 65481

List of values

[0, 1, 1, 1, 3, 3, 3, 8, 9, 10, 20, 24, 27, 49, 58, 69, 109, 132, 153, 234, 279, 331, 469, 565, 662, 918, 1093, 1290, 1723, 2056, 2411, 3165, 3751, 4411, 5656, 6700, 7839, 9932, 11707, 13699, 17084, 20099, 23441, 28939, 33914, 39498, 48236, 56392, 65481]