27770
domain: N
Appears in sequences
- Number of ways to place a non-attacking white and black pawn on n X n chessboard.at n=13A035290
- Number of Dyck n-paths starting U^mD^m (an m-pyramid), followed by a pyramid-free Dyck path.at n=12A035929
- Numbers n such that sigma(n)=2n-phi(phi(n)).at n=18A110073
- Numbers k such that k and k^2 use only the digits 0, 1, 2, 7 and 9.at n=30A136833
- 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, 0, -1), (0, 0, 1), (1, 0, -1)}.at n=10A148579
- a(n) = sum of minimal runlengths of all the partitions of n.at n=37A364808
- a(n) = sum of the side lengths of the minimum containing squares of all partitions of n.at n=26A368985