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.

A234757 Number of (n+1)X(5+1) 0..3 arrays with 2X2 edge jumps all no more than +1 in one of the clockwise or counterclockwise directions or both.

Original entry on oeis.org

712722, 392044622, 174451064914, 81436516016562, 37650372740746368, 17443322778721788150, 8077924001895128842744, 3741199763580832200930610, 1732660582029609793434136186, 802449881238851602750335840920
Offset: 1

Views

Author

R. H. Hardin, Dec 30 2013

Keywords

Comments

Column 5 of A234760

Examples

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