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 A373269 #18 May 30 2024 06:58:05
%S A373269 1,1,1,1,1,1,1,1,1,2,1,1,1,1,2,2,2,1,1,1,1,2,1,1,2,1,1,2,1,1,1,1,2,1,
%T A373269 1,2,2,2,2,2,2,2,2,1,1,1,1,2,1,1,2,1,1,2,2,2,2,1,2,2,2,1,2,2,2,1,1,1,
%U A373269 1,2,1,1,2,1,1,2,2,2,2,1,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,1,1,1,1,2,1,1,2,1,1,2,2,2,1,1,1,2,2,2,2,2,1,2,1,2,2,2,2,2,2,1,2,2,2,3,2,2,1,2,2,2,2,1
%N A373269 T(n,k) is the number of different multiplicities in the k-th partition of n in graded reverse lexicographic ordering (A080577).
%C A373269 The regular array for partitions of n of length k is A373270.
%C A373269 Row sums are A373271.
%H A373269 Olivier Gérard, <a href="/A373269/b373269.txt">Table of n, a(n) for n = 1..215307</a>
%e A373269 Array begins:
%e A373269 1,
%e A373269 1,1,
%e A373269 1,1,1,
%e A373269 1,1,1,2,1,
%e A373269 1,1,1,2,2,2,1,
%e A373269 1,1,1,2,1,1,2,1,1,2,1,
%e A373269 1,1,1,2,1,1,2,2,2,2,2,2,2,2,1
%e A373269 ...
%e A373269 T(10,34) is the first term with value 3. It corresponds to partition 3+2+2+1+1+1 of 10, which has three different multiplicities.
%t A373269 Flatten@Table[
%t A373269 Map[Length[Union[Length /@ Split[#]]] &, IntegerPartitions[n]], {n,
%t A373269 1, 20}]
%K A373269 nonn,tabf
%O A373269 1,10
%A A373269 _Olivier Gérard_, May 29 2024