|
|
A263290
|
|
Number of (2+3)X(n+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.
|
|
1
|
|
|
0, 156, 3904, 112628, 3593982, 93136678, 2762187801, 77552688910, 2215610117616, 63807535039468, 1850961678460734, 53583859714748754, 1553984896604421058, 45066079609967981158, 1306968031918351926352, 37898014345807061271026
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..0..0..0..0..0....0..1..1..0..1..1..1....0..0..0..1..0..1..1
..1..0..0..1..1..0..1....0..1..1..0..1..1..1....1..1..1..1..0..0..1
..1..1..0..0..0..1..1....0..1..0..0..0..0..1....0..0..1..0..1..1..0
..0..1..0..0..0..0..1....1..1..1..1..0..0..1....1..0..0..1..1..0..1
..1..1..1..1..0..0..1....1..1..0..1..1..1..0....0..1..0..0..0..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|