login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

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

%I #4 Sep 22 2015 09:30:12

%S 0,2892,124572,7577424,326005344,15231780324,655089996204,

%T 28755516792360,1236553617638640,53446495303862172,

%U 2298231625018170492,98951519822732397504,4254930564828132559104,183021121626516730866324

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

%C Column 6 of A262420.

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

%F Empirical: a(n) = 43*a(n-1) +777*a(n-2) -33411*a(n-3) -179235*a(n-4) +7707105*a(n-5) +17148167*a(n-6) -737371181*a(n-7) -706190268*a(n-8) +30366181524*a(n-9) +11010302352*a(n-10) -473443001136*a(n-11) -33794555200*a(n-12) +1453165873600*a(n-13)

%e Some solutions for n=3

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

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

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

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

%Y Cf. A262420.

%K nonn

%O 1,2

%A _R. H. Hardin_, Sep 22 2015