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.

A353845 Number of integer partitions of n such that if you repeatedly take the multiset of run-sums (or condensation), you eventually reach an empty set or singleton.

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 4
5 2
6 5
7 2
8 8
9 3
10 5
11 2
12 15
13 2
14 5
15 4
16 18
17 2
18 13
19 2
20 14
21 4
22 5
23 2
24 62
25 3
26 5
27 5
28 14
29 2
30 18
31 2
32 48
33 4
34 5
35 4
36 71
37 2
38 5
39 4
40 54
41 2
42 18
43 2
44 14
45 10
46 5
47 2
48 374
49 3
50 9
51 4
52 14
53 2
54 37
55 4
56 54
57 4
58 5
59 2
60 131

List of values

[1, 1, 2, 2, 4, 2, 5, 2, 8, 3, 5, 2, 15, 2, 5, 4, 18, 2, 13, 2, 14, 4, 5, 2, 62, 3, 5, 5, 14, 2, 18, 2, 48, 4, 5, 4, 71, 2, 5, 4, 54, 2, 18, 2, 14, 10, 5, 2, 374, 3, 9, 4, 14, 2, 37, 4, 54, 4, 5, 2, 131]