19028

Appears in sequences

• Number of permutations of [n] with exactly 3 increasing runs of length at least 2.at n=2A000507
• Triangle read by rows: T(n,k) is the number of permutations of [n] with k increasing runs of length at least 2.at n=23A008971
• Molecular topological indices of the path graphs P_n.at n=30A121318
• Number of n X n arrays of squares of integers with every 3X3 subblock summing to 7.at n=2A159207
• Number of n X n arrays of squares of integers with every (n-2)X(n-2) subblock summing to 7.at n=1A159369
• Triangle of polynomial coefficients related to the o.g.f.s. of the RBS1 polynomials.at n=13A160486
• Triangle of coefficients arising in expansion of n-th derivative of tan(x) + sec(x).at n=42A198895
• Number of -2..2 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having three, four or five distinct values for every i,j,k<=n.at n=14A211570
• Number of binary words of length n that contain all sixteen 4-bit words as (possibly overlapping) contiguous subwords.at n=3A242257
• Number of (n+1) X (7+1) 0..1 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally and vertically.at n=11A253158