cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A207750 Number of nX6 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 0 vertically.

Original entry on oeis.org

16, 256, 1296, 4900, 23716, 104976, 509796, 2421136, 11943936, 58828900, 294946276, 1484406784, 7542922500, 38500718656, 197686944400, 1018981226916, 5273535630724, 27375958697616, 142523723188900, 743755656909456
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Column 6 of A207752

Examples

			Some solutions for n=4
..0..1..0..1..0..0....0..1..0..1..0..1....1..1..1..0..0..0....1..1..1..1..0..1
..0..1..0..1..0..1....0..0..0..0..0..0....0..0..0..0..0..0....0..1..0..1..0..1
..0..0..0..0..0..0....0..1..0..1..0..1....1..1..1..0..0..0....1..0..1..0..0..0
..0..1..0..1..0..1....0..1..0..0..0..0....0..0..0..0..0..0....0..1..0..1..0..1
		

Formula

Empirical: a(n) = 16*a(n-1) -51*a(n-2) -429*a(n-3) +2765*a(n-4) +2887*a(n-5) -49472*a(n-6) +27551*a(n-7) +474394*a(n-8) -614722*a(n-9) -2782958*a(n-10) +4898822*a(n-11) +10501999*a(n-12) -22329850*a(n-13) -25727935*a(n-14) +64110703*a(n-15) +39685329*a(n-16) -118628973*a(n-17) -34454062*a(n-18) +139468939*a(n-19) +9485400*a(n-20) -98917632*a(n-21) +9240912*a(n-22) +37628064*a(n-23) -8055936*a(n-24) -5645376*a(n-25) +1679616*a(n-26) for n>27