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.

A241408 a(n) is the number of partitions of n such that the number of parts having multiplicity > 1 is a part.

Table of values

n a(n)
0 0
1 0
2 1
3 1
4 2
5 4
6 5
7 9
8 11
9 18
10 24
11 34
12 46
13 63
14 83
15 109
16 147
17 189
18 245
19 315
20 406
21 513
22 650
23 817
24 1030
25 1287
26 1593
27 1978
28 2450
29 3013
30 3689
31 4523
32 5511
33 6711
34 8140
35 9852
36 11892
37 14334
38 17217
39 20657
40 24727
41 29531
42 35197
43 41894
44 49761
45 59000
46 69861
47 82542
48 97393

List of values

[0, 0, 1, 1, 2, 4, 5, 9, 11, 18, 24, 34, 46, 63, 83, 109, 147, 189, 245, 315, 406, 513, 650, 817, 1030, 1287, 1593, 1978, 2450, 3013, 3689, 4523, 5511, 6711, 8140, 9852, 11892, 14334, 17217, 20657, 24727, 29531, 35197, 41894, 49761, 59000, 69861, 82542, 97393]