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.

A215793 Number of permutations of 0..floor((7*n-1)/2) on even squares of an 7*n array such that each row, column, diagonal and (downwards) antidiagonal of even squares is increasing.

Original entry on oeis.org

1, 1, 1, 8, 125, 2988, 146205, 6812794, 673507749, 48337803306
Offset: 1

Views

Author

R. H. Hardin Aug 23 2012

Keywords

Comments

Row 7 of A215788

Examples

			Some solutions for n=4
..0..x..1..x....0..x..1..x....0..x..1..x....0..x..1..x....0..x..1..x
..x..2..x..4....x..2..x..3....x..2..x..3....x..2..x..4....x..2..x..4
..3..x..5..x....4..x..5..x....4..x..5..x....3..x..5..x....3..x..5..x
..x..6..x..7....x..6..x..7....x..6..x..7....x..6..x..8....x..6..x..8
..8..x..9..x....8..x..9..x....8..x..9..x....7..x..9..x....7..x..9..x
..x.10..x.12....x.10..x.12....x.10..x.11....x.10..x.12....x.10..x.11
.11..x.13..x...11..x.13..x...12..x.13..x...11..x.13..x...12..x.13..x