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.

A209732 1/4 the number of (n+1)X5 0..3 arrays with every 2X2 subblock having distinct edge sums.

Original entry on oeis.org

3912, 86744, 1995752, 47572464, 1138541280, 27425792944, 660346502176, 15926642688032, 383927816903616, 9260294185296568, 223295813816665920, 5385580739872287984, 129876262463016021256, 3132320639165421379936
Offset: 1

Views

Author

R. H. Hardin Mar 12 2012

Keywords

Comments

Column 4 of A209736

Examples

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