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.

A241742 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 0
1 0
2 1
3 1
4 2
5 3
6 5
7 6
8 9
9 12
10 18
11 22
12 31
13 41
14 54
15 70
16 95
17 120
18 156
19 202
20 259
21 325
22 418
23 524
24 659
25 826
26 1032
27 1274
28 1581
29 1949
30 2397
31 2932
32 3592
33 4367
34 5307
35 6430
36 7783
37 9370
38 11288
39 13550
40 16233
41 19399
42 23179
43 27579
44 32812
45 38955
46 46155
47 54572
48 64524
49 76051

List of values

[0, 0, 1, 1, 2, 3, 5, 6, 9, 12, 18, 22, 31, 41, 54, 70, 95, 120, 156, 202, 259, 325, 418, 524, 659, 826, 1032, 1274, 1581, 1949, 2397, 2932, 3592, 4367, 5307, 6430, 7783, 9370, 11288, 13550, 16233, 19399, 23179, 27579, 32812, 38955, 46155, 54572, 64524, 76051]