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 A330792 #8 Feb 20 2020 13:57:17 %S A330792 1,1,1,2,2,1,4,5,3,1,9,13,10,4,1,21,35,34,17,5,1,51,96,117,73,26,6,1, %T A330792 127,267,405,315,136,37,7,1,323,750,1407,1362,713,229,50,8,1,835,2123, %U A330792 4899,5895,3741,1419,358,65,9,1,2188,6046,17083,25528,19635,8796,2565,529,82,10,1 %N A330792 T(n, k) = P(n-k, k) where P(n, x) = Sum_{k=0..n} A064189(n, k)*x^k. Triangle read by rows, for 0 <= k <= n. %e A330792 Triangle starts: %e A330792 [0] 1 %e A330792 [1] 1, 1 %e A330792 [2] 2, 2, 1 %e A330792 [3] 4, 5, 3, 1 %e A330792 [4] 9, 13, 10, 4, 1 %e A330792 [5] 21, 35, 34, 17, 5, 1 %e A330792 [6] 51, 96, 117, 73, 26, 6, 1 %e A330792 [7] 127, 267, 405, 315, 136, 37, 7, 1 %e A330792 [8] 323, 750, 1407, 1362, 713, 229, 50, 8, 1 %e A330792 [9] 835, 2123, 4899, 5895, 3741, 1419, 358, 65, 9, 1 %p A330792 P := (n, x) -> add(A064189(n, k)*x^k, k=0..n): %p A330792 seq(seq(P(n-k, k), k=0..n), n=0..10); %Y A330792 Cf. A064189. %K A330792 nonn,tabl %O A330792 0,4 %A A330792 _Peter Luschny_, Jan 01 2020