87210

Appears in sequences

• Number of permutations of [n+1] with exactly 1 increasing subsequence of length 3.at n=8A003517
• Number of tree-rooted planar maps with 3 faces and n vertices and no isthmuses.at n=16A006470
• Expansion of (1+x*C^4)*C^4, where C = (1-(1-4*x)^(1/2))/(2*x) is g.f. for Catalan numbers, A000108.at n=8A071715
• Number of 4-ary Lyndon words of length n over GF(4) with trace 0 and subtrace 1.at n=11A074447
• Triangle T(n,k) read by rows: permutations on 123...n with one abc pattern and no aj pattern with j<=k, n>2, k<n-1.at n=36A084249
• Triangle read by rows: T(n,k) is number of hill-free Dyck paths of semilength n and having k returns to the x-axis. (A Dyck path is said to be hill-free if it has no peaks at level 1.)at n=45A114494
• Triangle read by rows: T(n,k) is the number of Grand Dyck paths of semilength n that cross downwards the x-axis k times. (A Grand Dyck path of semilength n is a path in the half-plane x>=0, starting at (0,0), ending at (2n,0) and consisting of steps u=(1,1) and d=(1,-1)).at n=31A118919
• 9th column of Catalan triangle A009766.at n=5A124087
• Coefficients in a q-analog of the function LambertW(-2*x)/(-2*x), as a triangle read by rows.at n=43A152555
• Number of arrangements of n indistinguishable balls in n boxes with the maximum number of balls in any box equal to n-4.at n=13A180294
• Replace 3^i with n^i in ternary representation of n.at n=43A193760
• Number of ballot sequences of length n having 8 largest parts.at n=13A244105
• Numbers which are cyclops palindromic in their binary reflected Gray code representation.at n=8A279260
• Number of distinct binary strings in the n-th Fibonacci shuffle set.at n=6A306893
• Expansion of e.g.f. exp( Sum_{k>=0} x^(3*k+5) / (3*k+5)! ).at n=19A365897
• Arises from enumeration of a certain class of partial zig-zag knight's paths on the square grid.at n=20A368379