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 A264675 #4 Nov 20 2015 19:51:18 %S A264675 3,588,17443,714235,29875350,1095840260,40765995197,1494347569074, %T A264675 54204721906375,1966753578705875,71178721732614714, %U A264675 2573134003964620565,93001271214814999684,3360101883867911885437,121381797022850227205242 %N A264675 Number of (n+1)X(7+1) arrays of permutations of 0..n*8+7 with each element having directed index change -1,-1 1,0 -1,-2 -2,-2 or 0,1. %C A264675 Column 7 of A264676. %H A264675 R. H. Hardin, <a href="/A264675/b264675.txt">Table of n, a(n) for n = 1..45</a> %e A264675 Some solutions for n=3 %e A264675 .18..0.12..2..3.14..5..6...10..0..1.13..3..4..5..6...10..0.12..2..3..4..5..6 %e A264675 .17..1..9.10..4.22.13..7...17.18..2.21.22.12.23..7...26..1.20.21.11.23.13..7 %e A264675 ..8.27.28.11.19.30.31.15....8..9.27.11.19.31.14.15....8..9.17.18.29.31.14.15 %e A264675 .16.24.25.26.20.21.29.23...16.24.25.26.20.28.29.30...16.24.25.19.27.28.22.30 %Y A264675 Cf. A264676. %K A264675 nonn %O A264675 1,1 %A A264675 _R. H. Hardin_, Nov 20 2015