A263055 Number of (n+1)X(3+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.
10, 142, 1666, 18390, 188370, 1941702, 19499266, 196698070, 1968558130, 19732383462, 197355588066, 1974792933750, 19748600169490, 197518001324422, 1975194815632066, 19752765325169430, 197527991815422450
Offset: 1
Keywords
Examples
Some solutions for n=4 ..1..0..1..0....1..1..1..0....1..1..0..1....1..1..0..1....1..0..1..1 ..1..1..0..1....0..1..1..1....0..0..1..0....0..0..0..1....0..1..0..1 ..1..0..1..0....0..1..1..1....0..0..0..1....1..0..1..1....0..0..1..0 ..0..0..1..0....0..0..0..1....1..0..1..0....1..0..0..0....1..1..0..1 ..1..0..0..0....1..0..1..0....1..0..0..0....1..0..1..1....1..0..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A263060.
Formula
Empirical: a(n) = 11*a(n-1) +35*a(n-2) -495*a(n-3) -114*a(n-4) +6204*a(n-5) -4040*a(n-6) -17600*a(n-7) +16000*a(n-8)
Comments