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.

A244516 Number of partitions of n where the minimal multiplicity of any part is 3.

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 0
6 1
7 0
8 0
9 2
10 1
11 2
12 3
13 3
14 2
15 7
16 3
17 5
18 9
19 8
20 7
21 16
22 12
23 17
24 23
25 23
26 25
27 42
28 33
29 43
30 59
31 61
32 59
33 95
34 85
35 104
36 128
37 137
38 148
39 207
40 189
41 233
42 283
43 307
44 320
45 430
46 424
47 498
48 584
49 634
50 686
51 872
52 864
53 1011
54 1177
55 1280
56 1365
57 1687
58 1736
59 1987
60 2258
61 2470
62 2674
63 3208
64 3303
65 3767
66 4277
67 4658
68 5014
69 5916
70 6201

List of values

[0, 0, 1, 0, 0, 1, 0, 0, 2, 1, 2, 3, 3, 2, 7, 3, 5, 9, 8, 7, 16, 12, 17, 23, 23, 25, 42, 33, 43, 59, 61, 59, 95, 85, 104, 128, 137, 148, 207, 189, 233, 283, 307, 320, 430, 424, 498, 584, 634, 686, 872, 864, 1011, 1177, 1280, 1365, 1687, 1736, 1987, 2258, 2470, 2674, 3208, 3303, 3767, 4277, 4658, 5014, 5916, 6201]