38934

Appears in sequences

• Number of permutations of length n with 4 consecutive ascending pairs.at n=9A001260
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k consecutive ascending pairs (0 <= k <= n-1).at n=50A010027
• a(n) = A000166(n)*binomial(n,2).at n=7A065088
• Row sums in A083175.at n=26A083175
• Triangle read by rows: T(n,k) is the number of k-matchings in the C_n X P_3 graph (C_n is the cycle graph on n vertices and P_3 is the path graph on 3 vertices).at n=49A102089
• Triangle read by rows: T(n,k) is the number of permutations of [n] having k small descents (n >= 1; 0 <= k <= n-1). A small descent in a permutation (x_1,x_2,...,x_n) is a position i such that x_i - x_(i+1) = 1.at n=49A123513
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k UDDU's starting at level 1.at n=31A135328
• Number of Dyck paths of semilength n having no UDDU's starting at level 1.at n=11A135334
• a(n) = floor(1/{(10+n^4)^(1/4)}), where {}=fractional part.at n=45A184634
• a(n) = prime(n)*T(n), where T = A000217.at n=26A196421
• a(n) is the smallest k such that A261786(k) >= 3^n.at n=11A261788
• Number of nX3 0..1 arrays with every element unequal to 0, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=8A304546
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3, 4 or 6 king-move adjacent elements, with upper left element zero.at n=57A304551
• Expansion of Sum_{k>=0} x^k * Product_{j=1..k} (1 + j*x^j).at n=29A306730
• T(n,k)=Number of nXk 0..1 arrays with every element unequal to 0, 2, 3, 4, 6 or 8 king-move adjacent elements, with upper left element zero.at n=57A316376