|
|
A209533
|
|
Half the number of (n+1)X8 0..2 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences
|
|
1
|
|
|
257, 4097, 65537, 1048577, 16777217, 268435457, 4294967297, 68719476737, 1099511627777, 17592186044417, 281474976710657, 4503599627370497, 72057594037927937, 1152921504606846977, 18446744073709551617
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 16^(n+1)+1
|
|
EXAMPLE
|
Some solutions for n=4
..2..1..0..1..2..1..0..1....1..2..1..2..1..0..1..0....2..1..0..1..0..1..2..1
..1..2..1..2..1..0..1..2....2..1..2..1..2..1..2..1....1..2..1..2..1..0..1..2
..2..1..2..1..0..1..2..1....1..2..1..0..1..0..1..2....2..1..2..1..0..1..2..1
..1..2..1..2..1..0..1..0....2..1..0..1..0..1..2..1....1..2..1..0..1..2..1..2
..2..1..2..1..2..1..2..1....1..0..1..2..1..2..1..2....0..1..2..1..2..1..0..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|