|
|
A262330
|
|
Number of (n+1) X (6+1) 0..1 arrays with each row and column divisible by 3, read as a binary number with top and left being the most significant bits.
|
|
1
|
|
|
43, 261, 10935, 252097, 10789339, 394241389, 16940254423, 699094613961, 30056993215803, 1279198648576981, 55003871225837815, 2359070696262035857, 101439297012081117979, 4359072407628680510589, 187439773845177573589143
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 43*a(n-1) +793*a(n-2) -34099*a(n-3) -191667*a(n-4) +8241681*a(n-5) +20015927*a(n-6) -860684861*a(n-7) -980560940*a(n-8) +42164120420*a(n-9) +22309346640*a(n-10) -959301905520*a(n-11) -209959392832*a(n-12) +9028253891776*a(n-13) +540712883200*a(n-14) -23250653977600*a(n-15).
|
|
EXAMPLE
|
Some solutions for n=3
..1..1..0..1..1..0..0....0..0..0..0..0..0..0....0..0..1..1..1..1..0
..1..1..1..0..1..0..1....0..0..0..0..1..1..0....0..1..0..1..0..1..0
..0..0..1..0..1..0..1....0..0..0..0..1..1..0....1..1..0..0..0..1..1
..0..0..0..1..1..0..0....0..0..0..0..0..0..0....1..0..1..0..1..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|