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.

A207585 Number of nX4 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 0 1 and 1 1 1 vertically.

Original entry on oeis.org

10, 100, 144, 432, 1014, 2232, 5000, 11220, 25392, 54436, 120350, 264846, 571576, 1256072, 2715892, 5908344, 12871320, 27788516, 60537606, 131084800, 283976596, 617015956, 1334446520, 2896207628, 6276299562, 13590377602, 29485253424
Offset: 1

Views

Author

R. H. Hardin Feb 19 2012

Keywords

Comments

Column 4 of A207589

Examples

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

Formula

Empirical: a(n) = 3*a(n-2) +12*a(n-3) -3*a(n-4) -12*a(n-5) -61*a(n-6) -4*a(n-7) -a(n-8) +197*a(n-9) +12*a(n-10) +109*a(n-11) -375*a(n-12) +7*a(n-13) -346*a(n-14) +564*a(n-15) -75*a(n-16) +480*a(n-17) -607*a(n-18) +105*a(n-19) -355*a(n-20) +466*a(n-21) -36*a(n-22) +101*a(n-23) -288*a(n-24) -9*a(n-25) +21*a(n-26) +129*a(n-27) +a(n-28) -18*a(n-29) -42*a(n-30) +2*a(n-32) +9*a(n-33) -a(n-36) for n>38