32644

Appears in sequences

• Consider the 2^(n-1)-1 nonempty subsets S of {1, 2, ..., n-1}; a(n) gives number of such S for which it is impossible to partition n into parts from S such that each s in S is used at least once.at n=15A070880
• 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, -1), (-1, -1, 1), (-1, 1, 1), (1, 0, 1), (1, 1, 0)}.at n=8A150388
• Number of 5-step one space at a time bishop's tours on an n X n board summed over all starting positions.at n=20A187158
• Triangle read by rows: T(n,k) is the coefficient A_k in the transformation of 1 + x + x^2 + ... + x^n to the polynomial A_k*(x-3k)^k for 0 <= k <= n.at n=63A248978