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.
%I A366461 #11 Oct 24 2023 15:42:49
%S A366461 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,
%T A366461 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,
%U A366461 1,6,2,8,1,6,22,2,8,30,1,2,1,6,2,8,1,6,22
%N A366461 a(n) = number of partitions of n that have the maximum number of neighbors; see Comments.
%C A366461 Partitions p and q of n are neighbors if d(p,q) = 2, where d is the distance function in A366156.
%e A366461 Refer to the Example in A366429 to see that a(5) = 1.
%t A366461 c[n_] := PartitionsP[n];
%t A366461 q[n_, k_] := q[n, k] = IntegerPartitions[n][[k]];
%t A366461 r[n_, k_] := r[n, k] = Join[q[n, k], ConstantArray[0, n - Length[q[n, k]]]];
%t A366461 d[u_, v_] := d[u, v] = Total[Abs[u - v]];
%t A366461 s[n_, k_] := s[n, k] = Select[Range[c[n]], d[r[n, k], r[n, #]] == 2 &]
%t A366461 t[n_] := t[n] = Table[s[n, k], {k, 1, c[n]}]
%t A366461 a[n_] := Max[Map[Length, t[n]]]
%t A366461 b[n_] := b[n] = Select[t[n], Length[#] == a[n] &]
%t A366461 e[n_] := Length[b[n]]
%t A366461 Table[e[n], {n, 1, 24}]
%Y A366461 Cf. A000041, A366156, A366429.
%K A366461 nonn
%O A366461 1,2
%A A366461 _Clark Kimberling_, Oct 12 2023
%E A366461 More terms from _Pontus von Brömssen_, Oct 24 2023