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.

A161242 Number of partitions of n into central binomial coefficients A001405 where every part appears at least 3 times.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 1
6 2
7 1
8 2
9 3
10 3
11 3
12 6
13 5
14 6
15 9
16 8
17 9
18 14
19 12
20 14
21 19
22 19
23 21
24 28
25 26
26 30
27 37
28 38
29 41
30 53
31 50
32 56
33 68
34 69
35 74
36 91
37 88
38 98
39 115
40 118
41 125
42 150
43 149
44 163
45 188
46 192
47 204
48 239
49 239
50 260
51 293
52 303
53 322
54 367
55 372
56 400
57 444
58 462
59 487
60 548
61 557
62 597
63 657
64 682
65 718
66 795
67 812
68 868

List of values

[0, 0, 1, 1, 1, 2, 1, 2, 3, 3, 3, 6, 5, 6, 9, 8, 9, 14, 12, 14, 19, 19, 21, 28, 26, 30, 37, 38, 41, 53, 50, 56, 68, 69, 74, 91, 88, 98, 115, 118, 125, 150, 149, 163, 188, 192, 204, 239, 239, 260, 293, 303, 322, 367, 372, 400, 444, 462, 487, 548, 557, 597, 657, 682, 718, 795, 812, 868]