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

3, 5, 13, 31, 85, 223, 669, 1733, 4805, 13777, 40959, 120497, 360369, 1076007, 3222433, 9644107, 28932321, 86626753, 259625329, 778451521, 2335100115, 7003688357, 21010301629, 63027427231, 189078464965, 567219534943

Offset

1,1

Comments

Column 2 of A262240.

Links

R. H. Hardin, Table of n, a(n) for n = 1..210

Formula

Empirical: a(n) = 3*a(n-1) -a(n-2) +3*a(n-3) -a(n-4) +3*a(n-5) -a(n-6) +3*a(n-7) -a(n-8) +3*a(n-9) +706*a(n-10) -2118*a(n-11) +706*a(n-12) -2118*a(n-13) +706*a(n-14) -2118*a(n-15) +706*a(n-16) -2118*a(n-17) +706*a(n-18) -2118*a(n-19) -15709*a(n-20) +47127*a(n-21) -15709*a(n-22) +47127*a(n-23) -15709*a(n-24) +47127*a(n-25) -15709*a(n-26) +47127*a(n-27) -15709*a(n-28) +47127*a(n-29)

Example

Some solutions for n=5
..0..1..0..1..1....0..1..0..1..1....0..0..0..0..0....0..1..0..1..1
..0..1..0..1..1....0..0..0..0..0....0..0..0..0..0....1..0..1..1..0
..0..0..0..0..0....0..1..0..1..1....0..1..0..1..1....0..1..0..1..1
..0..1..0..1..1....0..0..0..0..0....0..1..0..1..1....1..0..1..1..0
..0..1..0..1..1....0..0..0..0..0....0..0..0..0..0....1..0..1..1..0
..0..1..0..1..1....0..1..0..1..1....0..1..0..1..1....0..1..0..1..1
..0..0..0..0..0....0..0..0..0..0....0..1..0..1..1....0..0..0..0..0
..0..0..0..0..0....0..1..0..1..1....0..1..0..1..1....0..1..0..1..1

Crossrefs

Cf. A262240.

Sequence in context: A281874 A135532 A127600 * A051401 A304357 A296023

Adjacent sequences: A262234 A262235 A262236 * A262238 A262239 A262240

Keyword

nonn

Author

R. H. Hardin, Sep 15 2015

Status

approved