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.

A184374 1/3 the number of (n+1)X8 0..2 arrays with every 2X2 subblock having at least two equal elements connected horizontally or vertically.

Original entry on oeis.org

3046491, 5040682279, 8177524177277, 13299774554091575, 21624059735461675335, 35159890626610196979641, 57168347029530545962203193, 92953139774330929595592449437, 151137575901032303453595440035363
Offset: 1

Views

Author

R. H. Hardin Jan 12 2011

Keywords

Comments

Column 7 of A184376

Examples

			Some solutions for 3X8 with a(1,1)=0
..0..0..0..0..1..1..2..1....0..0..0..0..0..0..1..0....0..0..0..0..2..0..2..1
..0..0..0..0..0..1..2..0....0..0..0..0..2..2..2..0....0..0..0..0..1..1..1..1
..0..0..0..0..0..0..0..0....0..0..0..0..2..0..1..1....0..0..0..0..0..0..0..2