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.

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

Original entry on oeis.org

693752, 62007896, 6111765608, 660346502176, 72515584004736, 8142073013529816, 914481225452329872, 103429210168484832664, 11680327691835359996376, 1322584722099506691068936, 149590064327411189639443688
Offset: 1

Views

Author

R. H. Hardin Mar 12 2012

Keywords

Comments

Column 7 of A209736

Examples

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