31238

Appears in sequences

• Triangle of Eulerian numbers with rows multiplied by 1 + x.at n=40A008518
• phi(s(n^3)) is a square, where s(n) is sigma(n)-n (A001065).at n=23A063798
• Triangle, read by rows, T(n, k) = 2*A123125(n-1, k), for n >= 2, otherwise T(n, 0) = T(n, n) = -1, with T(0, 0) = T(1, 0) = 1.at n=49A141591
• Triangle, read by rows, T(n, k) = 2*A123125(n-1, k), for n >= 2, otherwise T(n, 0) = T(n, n) = -1, with T(0, 0) = T(1, 0) = 1.at n=50A141591
• a(n) = a(n-1) + a(n-2) + k, n>1; with a(0) = 1, a(1) = 2, k = 3.at n=19A171516
• Eulerian version of the Catalan numbers, a(n) = A008292(2*n+1,n+1)/(n+1).at n=4A177042
• Number of (n+1) X (1+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=8A235080
• T(n,k) is the number of (n+1) X (k+1) 0..4 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4, with no adjacent elements equal (constant-stress tilted 1 X 1 tilings).at n=36A235087
• Number of permutations p of [n] such that the sequence of ascents and descents of p or of p0 (if n is even) forms a Dyck path.at n=9A303287
• Number T(n,k) of permutations of {0,1,...,2n} with first element k whose sequence of ascents and descents forms a Dyck path; triangle T(n,k), n>=0, 0<=k<=2n, read by rows.at n=34A316728
• Number T(n,k) of permutations p of [n] with exactly k descents such that the up-down signature of p has nonnegative partial sums; triangle T(n,k), n>=0, 0<=k<=max(0,floor((n-1)/2)), read by rows.at n=25A321280