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.

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

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 1
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 2
21 1
22 2
23 1
24 2
25 1
26 2
27 1
28 2
29 1
30 4
31 2
32 4
33 4
34 5
35 4
36 7
37 5
38 7
39 7
40 9
41 8
42 11
43 10
44 12
45 12
46 14
47 13
48 16
49 15
50 18
51 17
52 20
53 19
54 22
55 21
56 24
57 23
58 26
59 25
60 30
61 28
62 32
63 32
64 36
65 36
66 42
67 41
68 46
69 47
70 53
71 54
72 61
73 61
74 67
75 69
76 76
77 78
78 86
79 87
80 95
81 97
82 106
83 108
84 118
85 119
86 129
87 131
88 142

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 4, 2, 4, 4, 5, 4, 7, 5, 7, 7, 9, 8, 11, 10, 12, 12, 14, 13, 16, 15, 18, 17, 20, 19, 22, 21, 24, 23, 26, 25, 30, 28, 32, 32, 36, 36, 42, 41, 46, 47, 53, 54, 61, 61, 67, 69, 76, 78, 86, 87, 95, 97, 106, 108, 118, 119, 129, 131, 142]