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.

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

Original entry on oeis.org

10, 100, 378, 1377, 4823, 17119, 61292, 218243, 776100, 2765576, 9852117, 35078967, 124935587, 444991022, 1584772385, 5644067960, 20101607046, 71591508557, 254970749655, 908076480129, 3234105068568, 11518206999371, 41021924800776
Offset: 1

Views

Author

R. H. Hardin Feb 22 2012

Keywords

Comments

Column 4 of A208028

Examples

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

Formula

Empirical: a(n) = a(n-1) +a(n-2) +20*a(n-3) +27*a(n-4) +34*a(n-5) -21*a(n-6) -105*a(n-7) -149*a(n-8) +6*a(n-9) +254*a(n-10) +227*a(n-11) -101*a(n-12) -242*a(n-13) -93*a(n-14) +86*a(n-15) +77*a(n-16) +15*a(n-17) -34*a(n-18) -9*a(n-19) -5*a(n-20) +7*a(n-21) -2*a(n-22) -a(n-24) for n>25