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.

A207898 Number of 5Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 0 and 1 1 1 vertically.

Original entry on oeis.org

16, 256, 912, 3358, 11196, 38160, 135714, 471374, 1605156, 5575548, 19518498, 67332320, 231918056, 806844660, 2802896674, 9676886468, 33492050252, 116319708822, 402977537782, 1393754905624, 4830422996784, 16750871779658
Offset: 1

Views

Author

R. H. Hardin Feb 21 2012

Keywords

Comments

Row 5 of A207895

Examples

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

Formula

Empirical: a(n) = a(n-2) +22*a(n-3) +75*a(n-4) +17*a(n-5) -117*a(n-6) -458*a(n-7) -725*a(n-8) +381*a(n-9) +1016*a(n-10) +1368*a(n-11) +3547*a(n-12) -1145*a(n-13) -4283*a(n-14) -771*a(n-15) -4195*a(n-16) +1201*a(n-17) +5941*a(n-18) -6675*a(n-19) -135*a(n-20) -10857*a(n-21) -5880*a(n-22) +2907*a(n-23) +6297*a(n-24) +14561*a(n-25) +16988*a(n-26) +3747*a(n-27) +11377*a(n-28) -12490*a(n-29) +4260*a(n-30) -14383*a(n-31) +4618*a(n-32) -6234*a(n-33) +3070*a(n-34) -362*a(n-35) -509*a(n-36) +225*a(n-37) -668*a(n-38) -20*a(n-39) -29*a(n-40) +141*a(n-41) +20*a(n-42) +30*a(n-43) +3*a(n-44) -13*a(n-45) +15*a(n-46) +a(n-47) for n>50