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.

A383098 Number of integer partitions of n having at least one permutation with all equal run-sums.

Table of values

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

List of values

[1, 1, 2, 2, 4, 2, 7, 2, 7, 5, 7, 2, 19, 2, 7, 8, 14, 2, 27, 2, 24, 8, 7, 2, 58, 5, 7, 13, 30, 2, 72, 2, 38, 8, 7, 8, 135, 2, 7, 8, 91, 2, 112, 2, 45, 38, 7, 2, 258, 5, 51, 8, 54, 2, 208, 8, 143, 8, 7, 2, 525, 2, 7, 44, 153, 8, 256, 2, 75, 8, 136, 2, 891, 2, 7, 57, 87, 8]