49220
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, 0), (0, 1, 0), (1, 0, 0), (1, 1, 0), (1, 1, 1)}.at n=7A151252
- G.f. satisfies: A(x) = (1+x*A(x))*(1+x^2*A(x))*(1+x^3*A(x)).at n=13A182053
- Number of partitions of n such that the number of parts and the greatest part are not coprime.at n=46A200792