28808
domain: N
Appears in sequences
- Number of inequivalent ways (mod D_4) a pair of checkers can be placed on an n X n board.at n=25A014409
- Number of (s(0), s(1), ..., s(n)) such that every s(i) is a nonnegative integer, s(0) = 2, |s(1) - s(0)| = 1, |s(i) - s(i-1)| <= 1 for i >= 2. Also sum of numbers in row n+1 of the array T in A026148.at n=10A026165
- Smaller of Smith brothers.at n=14A050219
- a(n) = number of ways to dispose two pawns on a chessboard of size n X n (two dispositions are equivalent if one can be rotated or reflected to give the other one).at n=26A141582
- Number A(n,k) of Dyck paths having exactly k peaks in each of the levels 1,...,n and no other peaks; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=34A288972
- Number of Dyck paths having exactly one peak in each of the levels 1,...,n and no other peaks.at n=6A289020