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.

A234756 Number of (n+1)X(4+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

80010, 15939010, 2683721676, 469243923298, 81436516016562, 14155719250115192, 2459819737238954066, 427468816063895627714, 74284713081666378716324, 12909093718494739038921470, 2243322903467332769441789170
Offset: 1

Views

Author

R. H. Hardin, Dec 30 2013

Keywords

Comments

Column 4 of A234760

Examples

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