31390

Appears in sequences

• Numbers k such that k^2 has digits in nonincreasing order.at n=42A028821
• Number of (1,0) steps in all Grand Motzkin paths of length n.at n=9A109188
• Triangle read by rows: T(n,k) is the number of paths in the right half-plane from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k H=(2,0) steps (0 <= k <= floor(n/2)).at n=37A132885
• Expansion of x/((1 - x - x^4)*(1 - x)^2).at n=27A145131
• Number of 0..n arrays x(0..11) of 12 elements with zero 6th differences.at n=44A200374
• Number of nX7 0..1 arrays with every element unequal to 1, 2, 5 or 8 king-move adjacent elements, with upper left element zero.at n=8A304301