login
Number of (n+1)X(5+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.
1

%I #4 Oct 08 2015 14:59:52

%S 42,4314,188370,10416690,439260642,19763462754,830550961170,

%T 35491321238130,1490799705490242,62885673930539394,

%U 2641262874276464370,111053568381384471570,4664277162998698135842,195952869163413914931234

%N Number of (n+1)X(5+1) 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.

%C Column 5 of A263060.

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

%F Empirical: a(n) = 42*a(n-1) +711*a(n-2) -29862*a(n-3) -141183*a(n-4) +5929686*a(n-5) +10349613*a(n-6) -434683746*a(n-7) -267400116*a(n-8) +11230804872*a(n-9) +1666598976*a(n-10) -69997156992*a(n-11)

%e Some solutions for n=3

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

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

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

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

%Y Cf. A263060.

%K nonn

%O 1,1

%A _R. H. Hardin_, Oct 08 2015