96862
domain: N
Appears in sequences
- Consider all integer triples (i,j,k), j,k>0, with i^3=j^3+binomial(k+2,3), ordered by increasing i; sequence gives i values.at n=33A054234
- Half the number of ways of placing up to n pawns on a length n chessboard row so that the row balances at its middle.at n=23A133406
- 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, 1), (0, 1, -1), (1, -1, 1), (1, 0, 1)}.at n=10A148945