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 A113676 #9 Mar 05 2025 01:42:34 %S A113676 1,1,2,6,27,234,6202,1084009,4362192095 %N A113676 Number of elements of rows of Golomb's sequence A001462, with one less 2, interpreted as triangle: Start with first row 1. The row sum of row n-1 gives the number of elements taken from A001642 (one less 2) of row n. %C A113676 a(n+1) gives row sum of row n of this triangle. %C A113676 Conjecture: a(n) for n>1 gives first differences of Lionel Levine's sequence A014644(n) for n>=3. %C A113676 Conjecture: Final elements of the rows form A014644 except for duplicate 2. %e A113676 The triangle begins %e A113676 1; %e A113676 2; %e A113676 3,3; %e A113676 4,4,4,5,5,5; %e A113676 ... %e A113676 Row 4: [4,4,4,5,5,5] is generated from row 3: [3,3] because there are (3) 4's and (3) 5's in row 4. %K A113676 nonn,more %O A113676 1,3 %A A113676 _Floor van Lamoen_ and _Paul D. Hanna_, Nov 06 2005