Let P be a one-move "rider" with move set M={(1,2)}; a(n) is the number of non-attacking positions of two indistinguishable pieces P on an n X n board.
A222308
Let P be a one-move "rider" with move set M={(1,2)}; a(n) is the number of non-attacking positions of two indistinguishable pieces P on an n X n board.
Terms
- a(0) =0a(1) =6a(2) =34a(3) =114a(4) =285a(5) =602a(6) =1127a(7) =1940a(8) =3126a(9) =4790a(10) =7040a(11) =10006a(12) =13819a(13) =18634a(14) =24605a(15) =31912a(16) =40732a(17) =51270a(18) =63726a(19) =78330a(20) =95305a(21) =114906a(22) =137379a(23) =163004a(24) =192050a(25) =224822a(26) =261612a(27) =302750a(28) =348551a(29) =399370
External references
- oeis: A222308