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 A308230 #13 May 20 2019 00:42:12
%S A308230 1,2,0,3,1,1,4,2,0,2,0,5,3,1,3,1,1,1,6,4,2,4,0,2,2,2,0,2,0,7,5,3,5,1,
%T A308230 3,3,1,3,1,3,1,1,1,1,8,6,4,6,2,4,4,0,2,4,2,4,2,0,2,2,2,0,2,0,2,0,9,7,
%U A308230 5,7,3,5,5,1,3,5,3,5,1,3,1,3,3,3,3,1
%N A308230 Irregular triangle: row n shows the alternating sums of partitions of n when the parts are arranged in nonincreasing order and the partitions are arranged lexicographically from [n] to [1,1,1,...,1].
%C A308230 Row n consists of A000041(n) numbers, for n >= 1. The numbers in row n have the parity of n. Regarding row sums, see Comments at A066897.
%e A308230 First 8 rows:
%e A308230 1
%e A308230 2 0
%e A308230 3 1 1
%e A308230 4 2 0 2 0
%e A308230 5 3 1 3 1 1 1
%e A308230 6 4 2 4 0 2 2 2 0 2 0
%e A308230 7 5 3 5 1 3 3 1 3 1 3 1 1 1 1
%e A308230 8 6 4 6 2 4 4 0 2 4 2 4 2 0 2 2 2 0 2 0 2 0
%e A308230 Row 5 comes from arranging the 7 partitions of 5 is this order:
%e A308230 [5], [4,1], [3,2], [3,1,1], [2,2,1], [2,1,1,1], [1,1,1,1,1] and taking alternating sums: 5, 4-1, 3-1, 3-1+1, 2-2+1, 2-1+1-1, 1-1+1-1.
%t A308230 r[n_] := Map[Total[Map[Total, {Take[##], Drop[##]} &[#, {1, -1, 2}] {1, -1}]] &, IntegerPartitions[n]]; Column[Table[r[n], {n, 10}]] (* _Peter J. C. Moses_, May 15 2019 *)
%Y A308230 Cf. A000041, A066897.
%K A308230 nonn,tabf
%O A308230 1,2
%A A308230 _Clark Kimberling_, May 17 2019