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.

A244517 Number of partitions of n where the minimal multiplicity of any part is 4.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 0
6 0
7 0
8 1
9 0
10 0
11 0
12 2
13 1
14 2
15 1
16 4
17 2
18 3
19 3
20 6
21 3
22 6
23 4
24 10
25 6
26 10
27 7
28 19
29 13
30 17
31 16
32 31
33 22
34 34
35 28
36 48
37 39
38 54
39 49
40 76
41 62
42 84
43 79
44 120
45 96
46 133
47 124
48 179
49 162
50 202
51 193
52 275
53 249
54 315
55 300
56 412
57 379
58 480
59 467
60 603
61 577
62 711
63 696
64 905
65 850
66 1035
67 1038
68 1307
69 1258
70 1509
71 1511
72 1864
73 1834
74 2185
75 2171
76 2673
77 2636

List of values

[0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 2, 1, 2, 1, 4, 2, 3, 3, 6, 3, 6, 4, 10, 6, 10, 7, 19, 13, 17, 16, 31, 22, 34, 28, 48, 39, 54, 49, 76, 62, 84, 79, 120, 96, 133, 124, 179, 162, 202, 193, 275, 249, 315, 300, 412, 379, 480, 467, 603, 577, 711, 696, 905, 850, 1035, 1038, 1307, 1258, 1509, 1511, 1864, 1834, 2185, 2171, 2673, 2636]