25372
domain: N
Appears in sequences
- Triangle T(n, k, m) = coefficients of p(x, n, m) where p(x,n,m) = (x+1)*p(x, n-1, m) + (2^(m+n-1) + 2^(n-2)*[n>=3])*x*p(x, n-2, m) and m=0, read by rows.at n=38A154983
- Triangle T(n, k, m) = coefficients of p(x, n, m) where p(x,n,m) = (x+1)*p(x, n-1, m) + (2^(m+n-1) + 2^(n-2)*[n>=3])*x*p(x, n-2, m) and m=0, read by rows.at n=42A154983
- Numbers of pyramid polycubes of a given volume in dimension 5.at n=15A229924
- a(n) = n*prime(prime(n)) - prime(n).at n=32A230285
- Number of permutations of length n that avoid the patterns 4231, 4312, and 4321.at n=9A257561
- Number of multisets of exactly two partitions of positive integers into distinct parts with total sum of parts equal to n.at n=34A320787
- Number of permutations p of [n] such that |p(i) - p(i-1)| <= |p(i+1) - p(i)|.at n=33A338738