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.

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

Original entry on oeis.org

6350732, 9648827736, 11352560005654, 14155719250115192, 17443322778721788150, 21550277301402213440174, 26609690894048025312611822, 32860797539558791502159176652, 40579386469875550478586589580206
Offset: 1

Views

Author

R. H. Hardin, Dec 30 2013

Keywords

Comments

Column 6 of A234760.

Examples

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

Crossrefs

Cf. A234760.