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.

A085290 Max[p1^b1] over all sorted multiplicative partitions of n! of length n.

Table of values

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

List of values

[2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 16, 16, 16, 16, 16, 16, 16]