46936

Appears in sequences

• a(n) = T(n,n-1), T given by A026552. Also a(n) is the number of integer strings s(0),...,s(n) counted by T, such that s(n)=1.at n=13A026554
• a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A026519.at n=6A027263
• a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A026552.at n=6A027273
• a(n) = Sum_{k=0..m-1} T(n,k) * T(n,k+1), where m=n for n=0,1,2,3; m=2n for n >= 4; and T is given by A026082.at n=6A027316
• Number of pairs (lambda,mu) of partitions lambda of n and mu of five with mu <= lambda (by diagram containment).at n=26A303855