42366
domain: N
Appears in sequences
- a(0)=1, a(n) = Sum_{k=0..n} (binomial(n,k)^2 * binomial(n+k,k+1)^2)/n^2.at n=5A074635
- Number T(n,k) of permutations p of [n] such that in 0p the largest up-jump equals k and no down-jump is larger than 2; triangle T(n,k), n>=0, 0<=k<=n, read by rows.at n=61A291680
- a(n) = 27*n^2 - 21*n + 6 (n>=1).at n=39A304164
- Number of permutations p of [n] such that in 0p the largest up-jump equals six and no down-jump is larger than 2.at n=4A321113
- Row sums of A325433.at n=46A325434