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 A263818 #13 Aug 31 2025 13:15:38 %S A263818 32,948,18776,333429,6425985,124854432,2392853088,45898515536, %T A263818 882504683737,16961728977667,325906704633704,6262921821080860, %U A263818 120359817883976272,2313001901843303293,44449848853940930817,854215652423448900720,16415908945488548695104,315472929981841479177936 %N A263818 Number of (2+1) X (n+1) arrays of permutations of 0..n*3+2 with each element having index change (+-,+-) 0,0 0,1 0,2 or 1,0. %H A263818 R. H. Hardin, <a href="/A263818/b263818.txt">Table of n, a(n) for n = 1..210</a> %e A263818 Some solutions for n=3: %e A263818 ..2..3..0..1....0..1..2..7....1..3..6..7....1..3..6..2....2..0..1..3 %e A263818 ..6..7..5.11....4..5.10..3....0..5..2.11....0..9..7..5....4..6..7..5 %e A263818 ..4..9..8.10....8.11..6..9....4.10..8..9....4.11..8.10....8.10..9.11 %Y A263818 Row 2 of A263816. %K A263818 nonn,changed %O A263818 1,1 %A A263818 _R. H. Hardin_, Oct 27 2015