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 A334627 #21 Jul 09 2021 13:01:43 %S A334627 1,3,5,2,7,4,4,9,6,8,4,4,11,8,12,8,12,0,8,4,13,10,16,12,20,4,16,8,8,4, %T A334627 8,4,4,15,12,20,16,28,8,28,12,16,8,24,8,16,8,4,4,8,8,8,0,4,17,14,24, %U A334627 20,36,12,40,20,24,12,40,12,36,16,8,16,28,16,24,4,8,8,16,4,12,8,8,0,12,4,8,0,0,4 %N A334627 T(n,k) is the number of k's in the n-th row of Stern's triangle (A337277); triangle T(n,k), n >= 0, 1 <= k <= A000045(n+1), read by rows. %C A334627 All terms in the first column are odd, all other terms are even. %H A334627 Alois P. Heinz, <a href="/A334627/b334627.txt">Rows n = 0..21, flattened</a> %F A334627 Sum_{k=1..A000045(n+1)} k * T(n,k) = A000244(n). %e A334627 T(0,1) = 1 because Stern's triangle has one 1 in row n=0. %e A334627 T(2,2) = 2 because Stern's triangle has two 2's in row n=2. %e A334627 T(4,3) = 8 because Stern's triangle has eight 3's in row n=4. %e A334627 Triangle T(n,k) begins: %e A334627 1; %e A334627 3; %e A334627 5, 2; %e A334627 7, 4, 4; %e A334627 9, 6, 8, 4, 4; %e A334627 11, 8, 12, 8, 12, 0, 8, 4; %e A334627 13, 10, 16, 12, 20, 4, 16, 8, 8, 4, 8, 4, 4; %e A334627 15, 12, 20, 16, 28, 8, 28, 12, 16, 8, 24, 8, 16, 8, 4, 4, 8, 8, 8, 0, 4; %e A334627 ... %p A334627 b:= proc(n) option remember; `if`(n=0, [1], (l-> [1, l[1], %p A334627 seq([l[i-1]+l[i], l[i]][], i=2..nops(l)), 1])(b(n-1))) %p A334627 end: %p A334627 T:= n-> (p-> seq(coeff(p, x, i), i=1..degree(p)))(add(x^j, j=b(n))): %p A334627 seq(T(n), n=0..8); %Y A334627 Column k=1 gives A005408. %Y A334627 Row sums give A126646. %Y A334627 Row lengths give A000045(n+1). %Y A334627 Cf. A000244, A337277. %K A334627 nonn,look,tabf %O A334627 0,2 %A A334627 _Alois P. Heinz_, Sep 09 2020