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.

A124943 Table read by rows: number of partitions of n with k as low median.

Table of values

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

List of values

[1, 1, 1, 2, 0, 1, 3, 1, 0, 1, 4, 2, 0, 0, 1, 6, 3, 1, 0, 0, 1, 8, 4, 2, 0, 0, 0, 1, 11, 6, 3, 1, 0, 0, 0, 1, 15, 8, 4, 2, 0, 0, 0, 0, 1, 20, 12, 5, 3, 1, 0, 0, 0, 0, 1, 26, 16, 7, 4, 2, 0, 0, 0, 0, 0, 1, 35, 22, 10, 5, 3, 1, 0, 0, 0, 0, 0, 1, 45, 29, 14, 6, 4, 2, 0, 0, 0, 0, 0, 0, 1, 58, 40, 19, 8, 5, 3, 1]