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.

A264563 Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 with each element having directed index change 1,0 1,1 0,-1 or -1,1.

This page as a plain text file.
%I A264563 #4 Nov 17 2015 19:07:39
%S A264563 1,2,10,192,7808,1133040,298587595,235814997396,454723725317760
%N A264563 Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 with each element having directed index change 1,0 1,1 0,-1 or -1,1.
%C A264563 Diagonal of A264569.
%e A264563 Some solutions for n=4
%e A264563 ..1..5..3..4..8....1..2..3..4..8....1..2..6..4..8....1..2..3..7..8
%e A264563 ..0..7..2.12.13....0..7.11.12.13....0..7.11.12..3....6..0.11..9..4
%e A264563 .11.15..6.14..9....5.15..6.14..9....5.15.16.14..9....5.12.16.14.18
%e A264563 .10.20.18.22.23...10.20.18.22.23...10.20.18.13.23...10.20.21.13.23
%e A264563 .21.16.17.24.19...21.16.17.24.19...21.22.17.24.19...15.22.17.24.19
%Y A264563 Cf. A264569.
%K A264563 nonn
%O A264563 1,2
%A A264563 _R. H. Hardin_, Nov 17 2015