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.

Showing 1-5 of 5 results.

A229419 Number of 5X5 0..n zero-diagonal arrays with corresponding row and column sums equal.

Original entry on oeis.org

7736, 3801411, 345706336, 11782824375, 213067487016, 2476905427101, 20800072613376, 136134092151621, 731603301365000, 3351359707914031, 13453090382588256, 48331016196789131, 157962741320042456
Offset: 1

Views

Author

R. H. Hardin Sep 22 2013

Keywords

Comments

Row 5 of A229417

Examples

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

Links

A229415 Number of n X n 0..2 zero-diagonal arrays with corresponding row and column sums equal.

Original entry on oeis.org

1, 3, 45, 4743, 3801411, 23938685973, 1215663478473627
Offset: 1

Views

Author

R. H. Hardin Sep 22 2013

Keywords

Comments

Column 2 of A229417

Examples

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

A229416 Number of n X n 0..3 zero-diagonal arrays with corresponding row and column sums equal.

Original entry on oeis.org

1, 4, 136, 59008, 345706336, 28256240134144, 33097994593655140864
Offset: 1

Views

Author

R. H. Hardin Sep 22 2013

Keywords

Comments

Column 3 of A229417

Examples

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

A229418 Number of 4X4 0..n zero-diagonal arrays with corresponding row and column sums equal.

Original entry on oeis.org

152, 4743, 59008, 426425, 2164680, 8583967, 28371968, 81545697, 209841400, 493679879, 1078445952, 2213497273, 4308069416, 8009070975, 14306664448, 24674505857, 41252568408, 67081603015, 106399491200, 165011023737
Offset: 1

Views

Author

R. H. Hardin Sep 22 2013

Keywords

Comments

Row 4 of A229417

Examples

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

Formula

Empirical: a(n) = (29/140)*n^9 + (261/140)*n^8 + (811/105)*n^7 + (289/15)*n^6 + (1921/60)*n^5 + (2221/60)*n^4 + (6323/210)*n^3 + (3539/210)*n^2 + (208/35)*n + 1

A229420 Number of 6X6 0..n zero-diagonal arrays with corresponding row and column sums equal.

Original entry on oeis.org

1375952, 23938685973, 28256240134144, 7093199984236625, 657759228191876016, 30505804179367041217, 850029945152225681408
Offset: 1

Views

Author

R. H. Hardin Sep 22 2013

Keywords

Comments

Row 6 of A229417

Examples

			Some solutions for n=1
..0..0..0..0..1..0....0..0..0..0..1..1....0..0..0..0..0..0....0..0..0..0..0..1
..0..0..0..1..0..1....0..0..1..1..0..0....0..0..0..1..1..0....0..0..0..1..1..0
..0..0..0..1..1..0....0..0..0..0..0..1....0..0..0..0..0..1....0..1..0..0..0..1
..1..1..1..0..0..0....0..1..0..0..0..0....0..0..1..0..1..0....1..0..1..0..1..0
..0..1..1..1..0..0....1..1..0..0..0..0....0..1..0..1..0..0....0..1..0..1..0..0
..0..0..0..0..1..0....1..0..0..0..1..0....0..1..0..0..0..0....0..0..1..1..0..0
Showing 1-5 of 5 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.