Let P be a one-move "rider" with move set M={(1,2)}; a(n) is the number of non-attacking positions of three indistinguishable pieces P on an n X n board.

A222309

Let P be a one-move "rider" with move set M={(1,2)}; a(n) is the number of non-attacking positions of three indistinguishable pieces P on an n X n board.

Terms

    a(0) =0a(1) =4a(2) =70a(3) =476a(4) =1961a(5) =6204a(6) =16167a(7) =37040a(8) =76486a(9) =146300a(10) =262260a(11) =446844a(12) =728295a(13) =1144836a(14) =1742461a(15) =2581184a(16) =3730972a(17) =5280660a(18) =7331346a(19) =10008700a(20) =13453045a(21) =17835884a(22) =23345795a(23) =30210096a(24) =38675586a(25) =49036364a(26) =61608352a(27) =76764380a(28) =94901331a(29) =116483700

External references