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.

A383095 Number of integer partitions of n having exactly one permutation with all equal run-sums.

Table of values

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

List of values

[1, 1, 2, 2, 3, 2, 6, 2, 4, 5, 6, 2, 12, 2, 6, 8, 5, 2, 20, 2, 12, 8, 6, 2, 20, 5, 6, 12, 12, 2, 34, 2, 6, 8, 6, 8, 45, 2, 6, 8, 20, 2, 34, 2, 12, 28, 6, 2, 30, 5, 20, 8, 12, 2, 52, 8, 20, 8, 6, 2, 78, 2, 6, 28, 7, 8, 34, 2, 12, 8, 34, 2, 80, 2, 6, 28, 12, 8, 34, 2, 30, 25]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.