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.

A213700 Half the number of 5X5 0..n symmetric arrays with no 2X2 subblock summing to 2n.

Original entry on oeis.org

529, 750261, 109820000, 4286833981, 83545858925, 976919547736, 8159542628448, 51964311225934, 271341777491743, 1197645088919101, 4637119560078960, 16013821321719463, 50395763900241707, 145985579644461562
Offset: 1

Views

Author

R. H. Hardin Jun 18 2012

Keywords

Comments

Row 4 of A213697

Examples

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