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.
[n\k][0 1 2 3 4 5 6]
[ - ] -----------------------------------------------------
[ 0 ] 1, 1, 2, 4, 8, 16, 32 A011782
[ 1 ] 1, 1, 2, 5, 15, 52, 203 A000110
[ 2 ] 1, 1, 4, 31, 379, 6556, 150349 A005046
[ 3 ] 1, 1, 11, 365, 25323, 3068521, 583027547 A291973
[ 4 ] 1, 1, 36, 6271, 3086331, 3309362716, 6626013560301 A291975
A260878, A326998,
Formatted as a triangle:
[1]
[1, 1]
[1, 1, 2]
[1, 1, 2, 4]
[1, 1, 4, 5, 8]
[1, 1, 11, 31, 15, 16]
[1, 1, 36, 365, 379, 52, 32]
[1, 1, 127, 6271, 25323, 6556, 203, 64]
A327001 := proc(n, k) option remember; if k = 0 then return 1 fi; add(binomial(n*k - 1, n*j) * A327001(n, j), j = 0..k-1) end: for n from 0 to 6 do seq(A327001(n, k), k=0..6) od; # row-wise
A[n_, k_] := A[n, k] = If[k == 0, 1, Sum[Binomial[n*k-1, n*j]*A[n, j], {j, 0, k-1}]];
Table[A[n-k, k], {n, 0, 9}, {k, 0, n}] // Flatten (* Jean-François Alcover, Sep 27 2022 *)
CL := (f, x) -> PolynomialTools:-CoefficientList(f, x): A327002 := proc(n) local P, Q; P := proc(n) option remember; if n = 0 then return 1 fi; add(binomial(3*n, 3*k+3)*P(n-k-1)*x, k=0..n-1) end: Q := proc(n) option remember; if n = 0 then return 1 fi; add(binomial(3*n-1, 3*k)*Q(k)*Q(n-1-k), k=0..n-1) end: Q(n) - add(CL(P(n),x)[k+1]/k!, k=0..n) end: seq(A327002(n), n=0..15);
B := BellMatrix(n -> modp(n,2), 37): # defined in A264428. b := n -> add(k, k in B[2*n+1]): seq(euler(2*n+1, 0)*(-2)^(n+1) - b(n), n=0..18);