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.
%I A264141 #6 Nov 10 2015 11:16:09 %S A264141 832,90000,20768650,3798503424,758116015189,147813083354689, %T A264141 29086230347332416,5708414855075340816,1121408818216873313530, %U A264141 220236879426948300870144,43257308993366137748332485 %N A264141 Number of (n+1)X(7+1) arrays of permutations of 0..n*8+7 with each element having index change +-(.,.) 0,0 1,-2 or 1,1. %C A264141 Column 7 of A264142. %H A264141 R. H. Hardin, <a href="/A264141/b264141.txt">Table of n, a(n) for n = 1..145</a> %e A264141 Some solutions for n=2 %e A264141 ..0..1.11..9..4..5..6..7....0.10..8..3..4..5.15..7....0..1..2..9.10..5.15..7 %e A264141 ..8..3.10..2.18.13.20.21....2.18..1.11.12.13.20..6....8..3..4.11.12.13.23..6 %e A264141 .16.17.12.19.14.15.22.23...16.17..9.19.14.21.22.23...16.17.18.19.20.21.22.14 %Y A264141 Cf. A264142. %K A264141 nonn %O A264141 1,1 %A A264141 _R. H. Hardin_, Nov 04 2015