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.

A241745 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)
0 0
1 0
2 0
3 1
4 0
5 1
6 2
7 1
8 3
9 4
10 4
11 8
12 10
13 13
14 19
15 24
16 34
17 45
18 59
19 79
20 99
21 130
22 170
23 212
24 273
25 348
26 425
27 546
28 678
29 833
30 1041
31 1284
32 1558
33 1940
34 2351
35 2862
36 3496
37 4227
38 5093
39 6187
40 7409
41 8920
42 10706
43 12795
44 15277
45 18259
46 21671
47 25803
48 30579
49 36218
50 42836
51 50596

List of values

[0, 0, 0, 1, 0, 1, 2, 1, 3, 4, 4, 8, 10, 13, 19, 24, 34, 45, 59, 79, 99, 130, 170, 212, 273, 348, 425, 546, 678, 833, 1041, 1284, 1558, 1940, 2351, 2862, 3496, 4227, 5093, 6187, 7409, 8920, 10706, 12795, 15277, 18259, 21671, 25803, 30579, 36218, 42836, 50596]