29938
domain: N
Appears in sequences
- Number of triangular partitions of n of order 3.at n=37A084439
- 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, 0, 0), (-1, 1, 1), (0, 0, -1), (1, 0, 0)}.at n=10A148594
- a(n) = 2^m minus (the total number of distinct subsets of length-(m-n) binary words that can appear as the factor of a word of length m, for 0 <= n < m/2).at n=13A225865
- G.f. A(x) satisfies: x = Sum_{n=-oo..+oo} (-1)^n * x^(n*(n+1)) * A(x)^n.at n=13A355357