|
|
A262452
|
|
Number of (n+3) X (3+3) 0..1 arrays with each row and column divisible by 15, read as a binary number with top and left being the most significant bits.
|
|
1
|
|
|
5, 9, 17, 33, 389, 1097, 3153, 9185, 102085, 475273, 1918225, 7341601, 45546885, 251017801, 1184586065, 5236907489, 26493958853, 145025048713, 724192527633, 3444405620257, 16746027756933, 88145795072073, 446059692441169
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..0..0..0..0....0..0..0..0..0..0....1..1..1..1..0..0....0..0..0..0..0..0
..1..0..1..1..0..1....1..1..1..1..0..0....1..1..1..1..0..0....0..0..0..0..0..0
..0..0..0..0..0..0....0..0..0..0..0..0....1..1..1..1..0..0....0..0..0..0..0..0
..1..0..1..1..0..1....1..1..1..1..0..0....1..1..1..1..0..0....1..1..1..1..0..0
..1..0..1..1..0..1....1..1..1..1..0..0....0..0..0..0..0..0....1..1..1..1..0..0
..0..0..0..0..0..0....0..0..0..0..0..0....0..0..0..0..0..0....1..1..1..1..0..0
..1..0..1..1..0..1....1..1..1..1..0..0....0..0..0..0..0..0....1..1..1..1..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|