41462
domain: N
Appears in sequences
- a(n) = T(n, n-2), T given by A026552. Also a(n) = number of integer strings s(0), ..., s(n) counted by T, such that s(n) = 2.at n=12A026555
- a(n) = Sum_{k=0..2n-2} T(n,k) * T(n,k+2), with T given by A026519.at n=5A027264
- a(n) = Sum_{k=0..2n-2} T(n,k) * T(n,k+2), with T given by A026552.at n=5A027274
- a(n) = Sum_{k=0..m-2} T(n,k) * T(n,k+2), where m=n for n=0,1,2,3; m=2n for n >= 4; and T is given by A026082.at n=5A027317
- Number of n X n rook placements avoiding the pattern 102.at n=7A221958
- Number of 9-regular cubic partitions of n.at n=30A335604