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.

A237571 Number of (n+1)X(3+1) 0..3 arrays with the upper median minus the lower median of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.

Original entry on oeis.org

13924, 315664, 7379204, 173478980, 4093774632, 95639726868, 2255748816966, 52746091216472, 1244121688354740, 29088796774026344, 686098112079186338, 16041540535482336896, 378367591142818627910, 8846617965689182153740
Offset: 1

Views

Author

R. H. Hardin, Feb 09 2014

Keywords

Comments

Column 3 of A237574

Examples

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