121990

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, -1), (0, 1, 1), (1, -1, 1)}.at n=10A148915
• Number of integer partitions of n that are empty, or have smallest part dividing all the others, but do not have greatest part divisible by all the others.at n=48A343345