[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of ways to place any number of black and any number of white nonattacking knights on a (n+2) X (3+2) board.
1

%I #6 Jan 15 2022 22:25:11

%S 318659,11314071,463425639,17145057973,629694824303,23667617769817,

%T 891996903006527,33481355214548009,1258684591767307311,

%U 47365710615235761413,1782764221799264814205,67097943667181977772419

%N Number of ways to place any number of black and any number of white nonattacking knights on a (n+2) X (3+2) board.

%C Column 3 of A251531.

%H R. H. Hardin, <a href="/A251528/b251528.txt">Table of n, a(n) for n = 1..210</a>

%e Some solutions for n=1

%e ..0..0..0..0..0....0..0..2..2..0....0..2..0..0..0....0..0..0..0..0

%e ..0..2..2..2..0....0..0..1..2..2....0..0..1..0..2....0..2..0..1..0

%e ..0..2..2..0..2....1..2..0..0..0....0..2..2..1..1....2..1..2..2..1

%Y Cf. A251531.

%K nonn

%O 1,1

%A _R. H. Hardin_, Dec 04 2014