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.

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

This page as a plain text file.
%I A264265 #6 Nov 10 2015 11:29:18
%S A264265 4,48,3721,1143000,1608491236,10563801093680,324302970384650401,
%T A264265 44925988058251637085336
%N A264265 Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 with each element having index change +-(.,.) 0,0 1,0 or 1,2.
%C A264265 Diagonal of A264272.
%e A264265 Some solutions for n=3
%e A264265 ..6..1..2..7....4..1..2..7....0..7..2..3....4..1..2..3....4..1..6..3
%e A264265 ..8.11..0..3....0.11.10..3....4..9.10..1....0..5..6.11....0..9..2..7
%e A264265 ..4..9.10..5...12.13..6..5....8.15..6..5...12.13.10..7...12..5.14.11
%e A264265 .12.13.14.15....8..9.14.15...12.13.14.11....8..9.14.15....8.13.10.15
%Y A264265 Cf. A264272.
%K A264265 nonn
%O A264265 1,1
%A A264265 _R. H. Hardin_, Nov 10 2015