25368

Appears in sequences

• Number of n-stacks with strictly receding walls, or the number of Type A partitions of n in the sense of Auluck (1951).at n=42A001522
• Expansion of (1-x)/( (1+x)*(1-2*x)*(1-3*x)*(1-4*x)*(1-5*x)).at n=5A004058
• Triangle read by rows: T(n,k)=A(n,k)*binomial(n+k-1,n), where A(n,k) are the Eulerian numbers (A008292).at n=18A038675
• Number of reduced words of length n in Coxeter group on 4 generators S_i with relations (S_i)^2 = (S_i S_j)^3 = I.at n=11A162740
• Number of -1..1 arrays x(0..n+2) of n+3 elements with zero sum and nonzero second and third differences.at n=11A200197
• Number of length 4+3 0..n arrays with every four consecutive terms having the sum of some three elements equal to three times the fourth.at n=14A248541
• Binary "cubes"; numbers whose binary representation consists of three consecutive identical blocks.at n=23A297405
• Expansion of e.g.f. exp(x)*(1 + x + x^2/2)*(sec(x) + tan(x)).at n=8A308520
• Square array T(n, k) read by antidiagonals, n >= 0 and k >= 0: the lengths of runs in binary expansion of T(n, k) are obtained by adding those of n and of k (see Comments for precise definition).at n=49A322404
• Square array T(n, k) read by antidiagonals, n >= 0 and k >= 0: the lengths of runs in binary expansion of T(n, k) are obtained by adding those of n and of k (see Comments for precise definition).at n=50A322404
• Numbers whose binary expansion consists of alternating runs of 1's and 0's where each run of 0's is exactly one longer than the preceding run of 1's, and the expansion ends with a 0-run.at n=42A387269