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.

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

Original entry on oeis.org

21, 441, 1889, 6315, 32823, 138017, 738515, 3451393, 18459985, 91330863, 487900273, 2497699401, 13360428739, 69888755449, 374927533581, 1989044972519, 10707046454737, 57336073886865, 309657266929019, 1668728092514473
Offset: 1

Views

Author

R. H. Hardin Feb 18 2012

Keywords

Comments

Column 6 of A207564

Examples

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

Formula

Empirical: a(n) = 13*a(n-1) +21*a(n-2) -869*a(n-3) +1167*a(n-4) +25921*a(n-5) -61027*a(n-6) -461409*a(n-7) +1307303*a(n-8) +5518049*a(n-9) -16754393*a(n-10) -47155119*a(n-11) +143303719*a(n-12) +297553021*a(n-13) -858496963*a(n-14) -1406286693*a(n-15) +3688250489*a(n-16) +4984465847*a(n-17) -11481185897*a(n-18) -13149704547*a(n-19) +25930908661*a(n-20) +25469152675*a(n-21) -42215807347*a(n-22) -35539635477*a(n-23) +48785432574*a(n-24) +34851279298*a(n-25) -38943699158*a(n-26) -23230133746*a(n-27) +20520793444*a(n-28) +10043976396*a(n-29) -6608615256*a(n-30) -2624540040*a(n-31) +1127367144*a(n-32) +366164280*a(n-33) -72744480*a(n-34) -20217600*a(n-35) for n>36