A263056 Number of (n+1)X(4+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, 895, 18390, 498597, 10416690, 232738767, 4880746710, 104100946101, 2185333961490, 46071984907935, 967423105276470, 20335923462641157, 427044510774483570, 8970161111918918127, 188372284635598141590
Offset: 1
Keywords
Examples
Some solutions for n=3 ..1..0..0..1..1....0..0..0..1..0....0..0..1..1..1....0..0..0..0..1 ..0..0..1..0..0....1..1..0..0..1....1..1..0..0..1....1..0..1..0..0 ..1..1..0..1..0....1..1..1..0..0....0..1..0..1..1....0..1..1..1..0 ..0..0..0..1..0....1..1..0..0..1....0..1..0..1..0....1..0..1..0..0
Links
- R. H. Hardin, Table of n, a(n) for n = 1..210
Crossrefs
Cf. A263060.
Formula
Empirical: a(n) = 21*a(n-1) +189*a(n-2) -3969*a(n-3) -10719*a(n-4) +225099*a(n-5) +250803*a(n-6) -5266863*a(n-7) -2527200*a(n-8) +53071200*a(n-9) +9062928*a(n-10) -190321488*a(n-11)
Comments