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.

A244518 Number of partitions of n where the minimal multiplicity of any part is 5.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 0
7 0
8 0
9 0
10 1
11 0
12 0
13 0
14 0
15 2
16 1
17 2
18 1
19 2
20 3
21 3
22 2
23 4
24 2
25 6
26 4
27 5
28 4
29 7
30 7
31 8
32 8
33 10
34 11
35 18
36 13
37 19
38 19
39 22
40 29
41 32
42 29
43 37
44 37
45 53
46 48
47 60
48 54
49 68
50 79
51 84
52 86
53 104
54 99
55 133
56 125
57 149
58 151
59 183
60 191
61 219
62 223
63 259
64 268
65 335
66 320
67 377
68 391
69 448
70 487
71 547
72 552
73 640
74 666
75 781
76 795
77 908
78 923
79 1057
80 1139
81 1246
82 1312
83 1472
84 1508
85 1754

List of values

[0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 1, 2, 1, 2, 3, 3, 2, 4, 2, 6, 4, 5, 4, 7, 7, 8, 8, 10, 11, 18, 13, 19, 19, 22, 29, 32, 29, 37, 37, 53, 48, 60, 54, 68, 79, 84, 86, 104, 99, 133, 125, 149, 151, 183, 191, 219, 223, 259, 268, 335, 320, 377, 391, 448, 487, 547, 552, 640, 666, 781, 795, 908, 923, 1057, 1139, 1246, 1312, 1472, 1508, 1754]