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.

A213803 Number of 5 X 5 0..n symmetric arrays with all rows summing to floor(n*5/2).

Original entry on oeis.org

112, 5673, 87932, 815263, 4843626, 22698959, 84662388, 275879169, 782758404, 2036181209, 4827542558, 10773876919, 22498928491, 44939366943, 85390966217, 156814686053, 276999175867, 476278194021, 793826178700, 1294496520831
Offset: 1

Views

Author

R. H. Hardin, Jun 20 2012

Keywords

Comments

Row 5 of A213800.

Examples

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

Crossrefs

Cf. A213800.