113525

Appears in sequences

• Number of pyramids of the first kind in all paths from (0,0) to (3n,0) that stay in the first quadrant (but may touch the horizontal axis), consisting of steps u=(2,1),U=(1,2), or d=(1,-1) (a pyramid of the first kind is a sequence u^pd^p for some positive integer p, starting at the x-axis).at n=6A108453
• 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, 0, 0), (-1, 0, 1), (1, 0, 0), (1, 1, -1)}.at n=11A148613
• a(n) = Sum_{k=0..n} binomial(n,k)^3 * 4^k.at n=5A216483
• Number of nX3 0..1 arrays with every element unequal to 0, 1, 2, 4, 6, 7 or 8 king-move adjacent elements, with upper left element zero.at n=10A317233
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} k^j * binomial(n,j)^3.at n=50A336163
• a(n) = Sum_{k=0..floor(n/8)} (-1)^k * binomial(n-4*k,4*k).at n=28A348309