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.

A252572 Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and diagonal sum equal to 1 2 5 6 or 7 and every 3X3 column and antidiagonal sum not equal to 1 2 5 6 or 7.

Original entry on oeis.org

5401, 23007, 92725, 395500, 2538669, 11285381, 53055996, 337833222, 1537313257, 7468646942, 48266349656, 221948510836, 1091522283798, 7130961567961, 32949908161991, 162858861392766, 1070100774007537, 4955450639355900
Offset: 1

Views

Author

R. H. Hardin, Dec 18 2014

Keywords

Comments

Column 6 of A252574

Examples

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