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.

A161250 Number of partitions of n into central binomial coefficients A001405 where every part appears at least 11 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 0
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 2
23 1
24 2
25 1
26 2
27 1
28 2
29 1
30 2
31 1
32 2
33 3
34 3
35 3
36 5
37 4
38 5
39 6
40 6
41 6
42 8
43 7
44 9
45 10
46 10
47 11
48 13
49 12
50 14
51 15
52 15
53 16
54 18
55 18
56 19
57 21
58 21
59 22
60 24
61 24
62 25
63 27
64 27
65 28
66 32
67 31
68 33
69 36
70 37
71 39
72 44
73 44
74 47
75 51
76 53
77 57
78 63
79 64
80 68
81 73
82 76
83 81
84 88
85 90
86 95
87 101
88 106
89 111
90 120

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 3, 3, 5, 4, 5, 6, 6, 6, 8, 7, 9, 10, 10, 11, 13, 12, 14, 15, 15, 16, 18, 18, 19, 21, 21, 22, 24, 24, 25, 27, 27, 28, 32, 31, 33, 36, 37, 39, 44, 44, 47, 51, 53, 57, 63, 64, 68, 73, 76, 81, 88, 90, 95, 101, 106, 111, 120]