|
|
A263033
|
|
Number of (n+2)X(1+2) 0..1 arrays with each row and column not divisible by 5, read as a binary number with top and left being the most significant bits.
|
|
1
|
|
|
98, 512, 3711, 24013, 142344, 839216, 5128489, 31001921, 185695082, 1111399040, 6683005863, 40131775549, 240734834880, 1443900139952, 8665852404001, 52000488541745, 311993105964146, 1871866398248960, 11231623403277711
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
Empirical: a(n) = 9*a(n-1) -31*a(n-2) +117*a(n-3) +111*a(n-4) -3105*a(n-5) +11163*a(n-6) -44577*a(n-7) +54480*a(n-8) +312066*a(n-9) -1253202*a(n-10) +5661630*a(n-11) -10623030*a(n-12) -6302070*a(n-13) +44353650*a(n-14) -285745590*a(n-15) +608932635*a(n-16) -336973095*a(n-17) +17702745*a(n-18) +5906191005*a(n-19) -13283846169*a(n-20) +13243177431*a(n-21) -21990624909*a(n-22) -40461569577*a(n-23) +93075113494*a(n-24) -109367769060*a(n-25) +214864926232*a(n-26) +34835506992*a(n-27) -80389631520*a(n-28) +96467557824*a(n-29) -192935115648*a(n-30)
|
|
EXAMPLE
|
Some solutions for n=4
..0..1..1....1..1..1....0..1..0....0..1..0....0..1..1....0..1..0....1..1..0
..0..0..1....1..1..1....1..1..0....0..0..1....1..1..1....1..1..0....0..1..0
..0..0..1....0..1..0....1..1..1....0..0..1....1..0..0....0..0..1....1..1..0
..1..1..0....1..1..0....0..1..1....1..1..0....0..0..1....0..1..1....1..1..0
..1..1..1....0..1..1....0..1..0....1..1..0....1..0..0....0..1..1....0..1..1
..0..0..1....0..1..1....0..1..1....1..0..0....1..1..0....1..0..0....0..1..1
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|