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.

A264070 Number of (n+1) X (7+1) arrays of permutations of 0..n*8+7 with each element having index change +-(.,.) 0,0 1,1 or 1,2.

Original entry on oeis.org

610, 75625, 15892745, 3057071776, 601052131669, 118020590202856, 23180312098708413, 4552817445649814704, 894213655660356295077, 175631478939257301328632, 34495577433083786070527245, 6775236817617034700050817216, 1330716496160907700646992379893
Offset: 1

Views

Author

R. H. Hardin, Nov 02 2015

Keywords

Examples

			Some solutions for n=2:
..0..1..2..3.14..5..6..7...10..1..2.12..4..5.15..7....9..1..2..3..4..5..6..7
..8..9.19.20.12.23..4.15....8..0.19.21..3.22.14..6....8..0.10.20.22.23.14.15
.16.17.18.10.11.21.22.13...16.17.18..9.20.11.13.23...16.17.18.19.11.21.12.13
		

Crossrefs

Column 7 of A264071.

Formula

Empirical: a(n) = 191*a(n-1) +1102*a(n-2) -7594*a(n-3) -38349*a(n-4) +38507*a(n-5) for n > 8.