209685

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), (-1, -1, 1), (-1, 1, 0), (1, -1, 0), (1, 1, 0)}.at n=10A149528
• a(n) = Sum_{k=0..floor(3*n/11)} binomial(3*n-10*k,k).at n=26A392350