34923
domain: N
Appears in sequences
- 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), (0, 1, 0), (1, 0, -1), (1, 0, 1)}.at n=8A150272
- G.f. A(x) satisfies: 0 = [x^n] (1+x)^(n*(n-1)/2) / A(x) for n>0.at n=7A304184
- Sum of the fourth largest parts of the partitions of n into 9 parts.at n=45A326470
- Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of e.g.f. B(x)^k, where B(x) is the e.g.f. of A385058.at n=41A385061