32366

Appears in sequences

• T(2n,n-1), T given by A026714.at n=6A026716
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, -1), (-1, 1, 1), (0, -1, -1), (1, 0, 0)}.at n=11A148224
• Number of representations of n as a sum of products of distinct pairs of positive integers, considered to be equivalent when terms or factors are reordered.at n=46A211856
• Number of Dyck n-paths all of whose ascents and descents have lengths equal to 1 (mod 10).at n=40A212369
• Number of nX7 0..1 arrays with every element equal to 3, 5, 7 or 8 king-move adjacent elements, with upper left element zero.at n=22A298186
• Number of integer compositions of n that have only one part or whose consecutive parts are indivisible and the last and first part are also indivisible.at n=30A318726
• G.f. A(x) satisfies: 1 - x = Sum_{n>=0} (x^(3*n) + (-1)^n*A(x))^n.at n=19A352819