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.

A237756 Number of partitions of n such that 3*(greatest part) = (number of parts).

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 0
7 1
8 1
9 1
10 1
11 2
12 2
13 2
14 2
15 4
16 4
17 6
18 7
19 10
20 10
21 13
22 14
23 19
24 21
25 27
26 31
27 40
28 45
29 55
30 64
31 79
32 91
33 111
34 127
35 154
36 177
37 211
38 243
39 290
40 333
41 394
42 455
43 538
44 618
45 726
46 834
47 977
48 1121
49 1304
50 1495
51 1738
52 1989
53 2302
54 2633
55 3041
56 3473
57 3999
58 4562
59 5241

List of values

[0, 0, 1, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 4, 4, 6, 7, 10, 10, 13, 14, 19, 21, 27, 31, 40, 45, 55, 64, 79, 91, 111, 127, 154, 177, 211, 243, 290, 333, 394, 455, 538, 618, 726, 834, 977, 1121, 1304, 1495, 1738, 1989, 2302, 2633, 3041, 3473, 3999, 4562, 5241]