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.

A244515 Number of partitions of n where the minimal multiplicity of any part is 2.

Table of values

n a(n)
1 0
2 1
3 0
4 1
5 0
6 2
7 1
8 4
9 2
10 6
11 4
12 9
13 6
14 16
15 9
16 23
17 18
18 34
19 27
20 51
21 40
22 75
23 63
24 103
25 90
26 152
27 130
28 208
29 191
30 286
31 267
32 402
33 368
34 546
35 518
36 730
37 709
38 998
39 954
40 1322
41 1305
42 1751
43 1740
44 2330
45 2299
46 3056
47 3074
48 3968
49 4031
50 5202
51 5249
52 6721
53 6877
54 8642
55 8888
56 11147
57 11432
58 14248
59 14747
60 18097
61 18838
62 23093
63 23938
64 29186
65 30489

List of values

[0, 1, 0, 1, 0, 2, 1, 4, 2, 6, 4, 9, 6, 16, 9, 23, 18, 34, 27, 51, 40, 75, 63, 103, 90, 152, 130, 208, 191, 286, 267, 402, 368, 546, 518, 730, 709, 998, 954, 1322, 1305, 1751, 1740, 2330, 2299, 3056, 3074, 3968, 4031, 5202, 5249, 6721, 6877, 8642, 8888, 11147, 11432, 14248, 14747, 18097, 18838, 23093, 23938, 29186, 30489]