|
|
A262236
|
|
Number of (n+3) X (1+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.
|
|
1
|
|
|
2, 3, 6, 12, 24, 47, 94, 187, 373, 745, 1490, 2979, 5958, 11916, 23832, 47663, 95326, 190651, 381301, 762601, 1525202, 3050403, 6100806, 12201612, 24403224, 48806447, 97612894, 195225787, 390451573, 780903145, 1561806290, 3123612579, 6247225158
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 3*a(n-1) -2*a(n-2) -a(n-5) +3*a(n-6) -2*a(n-7).
Empirical: G.f.: -x*(-2+3*x-x^2-x^5+2*x^6) / ( (x-1)*(2*x-1)*(1+x)*(x^4-x^3+x^2-x+1) ). - R. J. Mathar, Sep 16 2015
|
|
EXAMPLE
|
Some solutions for n=5
..0..0..0..0....1..0..1..1....1..0..1..1....1..0..1..1....1..0..1..1
..0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0....1..0..1..1
..1..0..1..1....1..0..1..1....1..0..1..1....0..0..0..0....1..0..1..1
..1..0..1..1....1..0..1..1....1..0..1..1....1..0..1..1....1..0..1..1
..0..0..0..0....0..0..0..0....1..0..1..1....1..0..1..1....0..0..0..0
..1..0..1..1....0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0
..1..0..1..1....0..0..0..0....1..0..1..1....1..0..1..1....1..0..1..1
..1..0..1..1....0..0..0..0....1..0..1..1....0..0..0..0....0..0..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|