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.

A207115 Number of 6Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 0 1 and 1 1 0 vertically.

Original entry on oeis.org

12, 144, 556, 2239, 7837, 22714, 68737, 187054, 505040, 1346150, 3472283, 9030485, 23093108, 58964061, 150498240, 381786944, 970985642, 2462695787, 6245279141, 15844141700, 40148846797, 101805976056, 258034064806, 653990198430
Offset: 1

Views

Author

R. H. Hardin Feb 15 2012

Keywords

Comments

Row 6 of A207111

Examples

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

Formula

Empirical: a(n) = a(n-1) +11*a(n-2) +2*a(n-3) -65*a(n-4) -54*a(n-5) +189*a(n-6) +289*a(n-7) -247*a(n-8) -717*a(n-9) -70*a(n-10) +833*a(n-11) +558*a(n-12) -116*a(n-13) -140*a(n-14) -566*a(n-15) -1355*a(n-16) -342*a(n-17) +1914*a(n-18) +1998*a(n-19) -313*a(n-20) -1832*a(n-21) -1300*a(n-22) -34*a(n-23) +883*a(n-24) +1032*a(n-25) +316*a(n-26) -492*a(n-27) -565*a(n-28) -131*a(n-29) +159*a(n-30) +164*a(n-31) +64*a(n-32) -24*a(n-33) -47*a(n-34) -17*a(n-35) +9*a(n-36) +7*a(n-37) -a(n-39)