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

0, 42, 0, 504, 156, 0, 6960, 3904, 482, 0, 113028, 112628, 24160, 1512, 0, 1428036, 3593982, 1390988, 148510, 4610, 0, 21015946, 93136678, 86422940, 17053263, 913084, 14140, 0, 282937866, 2762187801, 4398542684, 2075294247, 209176183

Offset

1,2

Comments

Table starts

.0.....42......504.......6960......113028......1428036.....21015946...282937866

.0....156.....3904.....112628.....3593982.....93136678...2762187801.77552688910

.0....482....24160....1390988....86422940...4398542684.258671639594

.0...1512...148510...17053263..2075294247.207491589620

.0...4610...913084..209176183.50010434372

.0..14140..5601776.2572716056

.0..42420.33964920

.0.129444

Links

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

Formula

Empirical for column k:

k=1: a(n) = a(n-1)

k=2: [order 29]

Example

Some solutions for n=3 k=4
..1..1..0..1..1..1..0....0..1..1..0..1..1..1....1..1..1..1..0..0..1
..0..0..0..1..0..1..1....0..0..1..0..1..1..0....0..0..0..1..0..1..1
..0..1..1..0..1..1..1....1..1..1..1..0..0..1....0..1..0..0..0..0..1
..0..1..0..0..0..0..1....0..1..0..0..0..0..1....0..1..0..0..0..0..1
..0..0..0..1..0..1..1....0..1..0..0..0..0..1....0..1..1..0..1..1..1
..0..1..1..0..1..1..1....0..0..1..0..1..1..0....0..0..1..0..1..1..0

Crossrefs

Sequence in context: A022074 A335188 A263303 * A216799 A203484 A176920

Adjacent sequences: A263285 A263286 A263287 * A263289 A263290 A263291

Keyword

nonn,tabl

Author

R. H. Hardin, Oct 13 2015

Status

approved