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.

A335941 Number of partitions of n such that the set s of parts and multiplicities satisfies s = {1..max(s)}.

Table of values

n a(n)
0 1
1 1
2 2
3 1
4 1
5 4
6 2
7 5
8 5
9 9
10 8
11 15
12 11
13 14
14 22
15 28
16 30
17 36
18 37
19 53
20 60
21 80
22 83
23 104
24 114
25 148
26 157
27 201
28 218
29 283
30 284
31 362
32 400
33 455
34 518
35 624
36 697
37 807
38 907
39 1036
40 1181
41 1368
42 1531
43 1727
44 1990
45 2197
46 2563
47 2849
48 3182
49 3568
50 4095
51 4548
52 5143
53 5720
54 6420

List of values

[1, 1, 2, 1, 1, 4, 2, 5, 5, 9, 8, 15, 11, 14, 22, 28, 30, 36, 37, 53, 60, 80, 83, 104, 114, 148, 157, 201, 218, 283, 284, 362, 400, 455, 518, 624, 697, 807, 907, 1036, 1181, 1368, 1531, 1727, 1990, 2197, 2563, 2849, 3182, 3568, 4095, 4548, 5143, 5720, 6420]