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 A308916 #8 Jul 03 2019 04:08:20
%S A308916 1,1,1,2,1,2,1,2,3,1,2,3,6,1,2,3,5,6,1,2,3,5,6,9,1,2,3,5,6,8,9,14,1,2,
%T A308916 3,5,6,8,9,14,15,23,1,2,3,5,6,8,9,13,14,15,21,24,1,2,3,5,6,8,9,13,14,
%U A308916 15,21,22,25,33,34,1,2,3,5,6,8,9,13,14,15
%N A308916 Irregular triangular array: row n shows positions of strict partitions of n among all partitions of n, using Mathematica ordering.
%e A308916 1
%e A308916 1
%e A308916 1 2
%e A308916 1 2
%e A308916 1 2 3
%e A308916 1 2 3 6
%e A308916 1 2 3 5 6
%e A308916 1 2 3 5 6 9
%e A308916 1 2 3 5 6 8 9 14
%e A308916 1 2 3 5 6 8 9 14 15 23
%e A308916 Strict partitions of 6: {6}, {5, 1}, {4, 2}, {3, 2, 1}, which occupy positions 1,2,3,6 in the ordering of all partitions of 6: {6}, {5, 1}, {4, 2}, {4, 1, 1}, {3, 3}, {3, 2, 1}, {3, 1, 1, 1}, {2, 2, 2}, {2, 2, 1, 1}, {2, 1, 1, 1, 1}, {1, 1, 1, 1, 1, 1}
%t A308916 p[n_] := IntegerPartitions[n];
%t A308916 d[n_] := Select[p[n], Max[Length /@ Split@#] == 1 &];
%t A308916 t = Table[Flatten[Table[Position[p[n], d[n][[k]]], {k, 1, Length[d[n]]}]], {n, 1, 15}]
%t A308916 Flatten[t] (* A308916, sequence *)
%Y A308916 Cf. A000009, A000041, A118457, A035399.
%K A308916 nonn,tabf,easy
%O A308916 1,4
%A A308916 _Clark Kimberling_, Jun 30 2019