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 A211028 #12 Oct 26 2024 05:00:27
%S A211028 1,2,1,1,3,2,1,1,1,1,2,2,4,3,1,2,1,1,1,1,1,1,3,2,5,2,2,1,4,1,3,1,1,2,
%T A211028 1,1,1,1,1,1,1,1,2,2,2,4,2,3,3,6,3,2,1,5,1,2,2,1,1,4,1,1,3,1,1,1,2,1,
%U A211028 1,1,1,1,1,1,1,1,1,3,2,2,5,2,4,3,7,2,2,2,1
%N A211028 A list of ordered partitions of the positive integers.
%C A211028 We start with 1. Then for each positive integer j the sequence lists the partitions of j that do not contain 1 as a part, in lexicographical order. Then the sequence lists the partitions of j-1 together with one part of size 1 as the last part of that partition. Then the partitions of j-2 together with two parts of size 1, and so on.
%e A211028 Written as an irregular triangle, in which row n lists the partitions of n, the sequence begins:
%e A211028 {1};
%e A211028 {2},{1,1};
%e A211028 {3},{2,1},{1,1,1};
%e A211028 {2,2},{4},{3,1},{2,1,1},{1,1,1,1};
%e A211028 {3,2},{5},{2,2,1},{4,1},{3,1,1},{2,1,1,1},{1,1,1,1,1};
%e A211028 {2,2,2},{4,2},{3,3},{6},{3,2,1},{5,1},{2,2,1,1},{4,1,1},{3,1,1,1},{2,1,1,1,1},{1,1,1,1,1,1};
%e A211028 ...
%Y A211028 Cf. A026792, A135010.
%K A211028 nonn,tabf
%O A211028 1,2
%A A211028 _Omar E. Pol_, Oct 30 2012