|
|
A262798
|
|
Number of (3+2)X(n+2) 0..1 arrays with each row divisible by 5 and column not divisible by 5, read as a binary number with top and left being the most significant bits.
|
|
1
|
|
|
0, 625, 4898, 81954, 2070492, 53647609, 1257963666, 30643228956, 766336126200, 19178182400305, 477743441514410, 11924267842928490, 298111233560156100, 7453091005918000825, 186286937922323294250, 4656697984190140422900
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..0..1..0..0....1..1..1..1..0..0....1..1..1..1..0..0....0..1..1..1..1..0
..1..1..0..1..1..1....0..0..1..0..1..0....0..0..0..1..0..1....0..1..0..1..0..0
..1..0..0..0..1..1....0..1..1..0..0..1....0..0..1..1..1..1....0..1..0..1..0..0
..0..1..1..0..0..1....1..1..0..1..1..1....0..0..1..1..1..1....1..0..1..1..0..1
..1..0..1..0..0..0....0..0..1..0..1..0....1..1..1..1..0..0....0..1..0..1..0..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|