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.

A363728 Number of integer partitions of n that are not constant but satisfy (mean) = (median) = (mode), assuming there is a unique mode.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 1
9 0
10 1
11 0
12 4
13 0
14 3
15 3
16 7
17 0
18 12
19 0
20 18
21 12
22 9
23 0
24 50
25 12
26 14
27 33
28 54
29 0
30 115
31 0
32 92
33 75
34 31
35 99
36 323
37 0
38 45
39 162
40 443
41 0
42 507
43 0
44 467
45 732
46 88
47 0
48 1551
49 274
50 833
51 627
52 1228
53 0
54 2035
55 1556
56 2859
57 1152
58 221
59 0
60 9008
61 0
62 295
63 4835
64 5358

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 4, 0, 3, 3, 7, 0, 12, 0, 18, 12, 9, 0, 50, 12, 14, 33, 54, 0, 115, 0, 92, 75, 31, 99, 323, 0, 45, 162, 443, 0, 507, 0, 467, 732, 88, 0, 1551, 274, 833, 627, 1228, 0, 2035, 1556, 2859, 1152, 221, 0, 9008, 0, 295, 4835, 5358]