|
|
A262919
|
|
Number of (5+1)X(n+1) 0..1 arrays with each row divisible by 3 and each column divisible by 7, read as a binary number with top and left being the most significant bits.
|
|
1
|
|
|
10, 27, 318, 1411, 18190, 121507, 1444558, 12031011, 132033870, 1214394787, 12726094798, 122360994211, 1252258147150, 12289486776867, 124300598233038, 1231754978783011, 12386462076574030, 123317516595907747
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 14*a(n-1) +39*a(n-2) -1106*a(n-3) +1561*a(n-4) +22386*a(n-5) -57539*a(n-6) -89894*a(n-7) +251940*a(n-8) +68600*a(n-9) -196000*a(n-10)
|
|
EXAMPLE
|
Some solutions for n=4
..0..0..0..1..1....1..1..0..1..1....0..0..0..0..0....0..0..0..0..0
..0..0..0..1..1....0..0..1..1..0....0..0..1..1..0....0..0..1..1..0
..1..0..1..0..1....1..1..1..1..0....0..0..0..0..0....0..0..0..0..0
..1..0..1..0..1....0..0..1..1..0....0..1..1..1..1....1..1..1..1..0
..1..0..1..0..1....1..1..0..1..1....0..1..0..0..1....1..1..0..0..0
..0..0..0..1..1....0..0..0..1..1....0..1..1..1..1....1..1..1..1..0
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|