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.

A324572 Number of integer partitions of n whose multiplicities (where if x < y the multiplicity of x is counted prior to the multiplicity of y) are equal to the distinct parts in decreasing order.

Table of values

n a(n)
0 1
1 1
2 0
3 0
4 2
5 0
6 1
7 0
8 1
9 1
10 2
11 0
12 3
13 0
14 2
15 0
16 4
17 1
18 2
19 1
20 4
21 1
22 3
23 1
24 5
25 3
26 5
27 1
28 6
29 2
30 6
31 1
32 7
33 2
34 7
35 2
36 11
37 4
38 8
39 3
40 11
41 5
42 10
43 4
44 13
45 5
46 11
47 5
48 16
49 8
50 14
51 5
52 19
53 8
54 18
55 6
56 22
57 8
58 22
59 7
60 26
61 10
62 25
63 8
64 33
65 12
66 29
67 11
68 36
69 13
70 34
71 12
72 40
73 16
74 41
75 14
76 47
77 17
78 45
79 16
80 55

List of values

[1, 1, 0, 0, 2, 0, 1, 0, 1, 1, 2, 0, 3, 0, 2, 0, 4, 1, 2, 1, 4, 1, 3, 1, 5, 3, 5, 1, 6, 2, 6, 1, 7, 2, 7, 2, 11, 4, 8, 3, 11, 5, 10, 4, 13, 5, 11, 5, 16, 8, 14, 5, 19, 8, 18, 6, 22, 8, 22, 7, 26, 10, 25, 8, 33, 12, 29, 11, 36, 13, 34, 12, 40, 16, 41, 14, 47, 17, 45, 16, 55]