A262422 Number of (3+1) X (n+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.
10, 12, 270, 1260, 15310, 124572, 1299070, 12380940, 124921710, 1235566332, 12379963870, 123483616620, 1235387708110, 12346379507292, 123476688644670, 1234585890852300, 12346166930494510, 123457247499499452
Offset: 1
Keywords
Examples
Some solutions for n=4 ..1..1..0..1..1....0..1..1..1..1....0..0..0..1..1....0..0..1..1..0 ..0..0..1..1..0....1..1..1..1..0....1..1..0..1..1....0..1..0..0..1 ..0..1..1..1..1....1..1..0..1..1....1..0..0..1..0....1..0..1..0..1 ..0..1..1..0..0....1..0..1..0..1....1..0..1..0..1....0..1..0..0..1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A262420.
Formula
Empirical: a(n) = 10*a(n-1) +46*a(n-2) -460*a(n-3) -609*a(n-4) +6090*a(n-5) +2164*a(n-6) -21640*a(n-7) -1600*a(n-8) +16000*a(n-9).
Comments