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.

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

Table of values

n a(n)
1 0
2 1
3 1
4 2
5 1
6 4
7 2
8 5
9 5
10 7
11 6
12 12
13 9
14 14
15 15
16 19
17 18
18 28
19 24
20 34
21 35
22 43
23 42
24 59
25 53
26 70
27 72
28 86
29 86
30 112
31 105
32 132
33 136
34 158
35 160
36 198
37 191
38 231
39 238
40 273
41 277
42 332
43 326
44 384
45 394
46 447
47 455
48 532
49 529
50 610
51 626
52 703
53 717
54 821
55 824
56 934
57 959
58 1066
59 1089
60 1230
61 1240
62 1388

List of values

[0, 1, 1, 2, 1, 4, 2, 5, 5, 7, 6, 12, 9, 14, 15, 19, 18, 28, 24, 34, 35, 43, 42, 59, 53, 70, 72, 86, 86, 112, 105, 132, 136, 158, 160, 198, 191, 231, 238, 273, 277, 332, 326, 384, 394, 447, 455, 532, 529, 610, 626, 703, 717, 821, 824, 934, 959, 1066, 1089, 1230, 1240, 1388]