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.

A264486 Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change 2,-1 1,0 2,1 0,-1 -2,-2 or -1,0.

Original entry on oeis.org

1, 10, 36, 212, 2144, 9714, 92052, 581575, 4510937, 31398740, 236553733, 1681262954, 12489549989, 90270132471, 663622115288, 4832089305548, 35389917941640, 258336002558736, 1889497035402309, 13806771114617572
Offset: 1

Views

Author

R. H. Hardin, Nov 14 2015

Keywords

Comments

Column 3 of A264490.

Examples

			Some solutions for n=4
..4..5..6..7....4..5..6..7....4..5..3..7....4..5..6..7....4..5..3..7
..8..1..2..3....0..1..2.11....0..9..2.11....0..1.10..3....0..1.10.11
.12..0.14.15....9.13..3.15...12.13..1.15...12.13.14..2...12.13.14..2
.16.17.18.11...16.17.18.19...16..6.18.19...16..9.18.19...16.17.18..6
..9.13.19.10...12..8.14.10...17..8.14.10...17..8.11.15....9..8.19.15
		

Crossrefs

Cf. A264490.