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.

A366461 a(n) = number of partitions of n that have the maximum number of neighbors; see Comments.

Table of values

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

List of values

[1, 2, 1, 2, 1, 1, 2, 1, 6, 1, 2, 1, 6, 2, 1, 2, 1, 6, 2, 8, 1, 2, 1, 6, 2, 8, 1, 1, 2, 1, 6, 2, 8, 1, 6, 1, 2, 1, 6, 2, 8, 1, 6, 22, 1, 2, 1, 6, 2, 8, 1, 6, 22, 2, 1, 2, 1, 6, 2, 8, 1, 6, 22, 2, 8, 1, 2, 1, 6, 2, 8, 1, 6, 22, 2, 8, 30, 1, 2, 1, 6, 2, 8, 1, 6, 22]