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.

A251365 Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock summing to 1 2 3 4 5 6 or 7.

Original entry on oeis.org

79, 17969, 35257505, 597108952883, 87274898497023663, 110094177769643072247073, 1198610045118318903896947691841, 112623783277770500761933316031229772803
Offset: 1

Views

Author

R. H. Hardin, Dec 01 2014

Keywords

Comments

Diagonal of A251373

Examples

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