Triangle T(n, k) = f(n, k) + f(n, n-k), where f(n, k) = A001263(n*k+1, n-k+1) if k <= n otherwise A001263(n*(n-k)+1, k+1) and T(1, k) = 1, read by rows.
A157118
Triangle T(n, k) = f(n, k) + f(n, n-k), where f(n, k) = A001263(n*k+1, n-k+1) if k <= n otherwise A001263(n*(n-k)+1, k+1) and T(1, k) = 1, read by rows.
Terms
- a(0) =2a(1) =1a(2) =1a(3) =1a(4) =6a(5) =1a(6) =1a(7) =27a(8) =27a(9) =1a(10) =1a(11) =88a(12) =672a(13) =88a(14) =1a(15) =1a(16) =225a(17) =9150a(18) =9150a(19) =225a(20) =1a(21) =1a(22) =486a(23) =98385a(24) =395352a(25) =98385a(26) =486a(27) =1a(28) =1a(29) =931
External references
- oeis: A157118