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.

A263512 Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 filled by rows with each element moved a city block distance of 0 or 1.

This page as a plain text file.
%I A263512 #6 Nov 10 2015 12:11:56
%S A263512 3,35,2076,489294,529329240,2543460828164,55588636099730695,
%T A263512 5525569263450576586033
%N A263512 Number of (n+1)X(n+1) arrays of permutations of 0..(n+1)^2-1 filled by rows with each element moved a city block distance of 0 or 1.
%C A263512 Diagonal of A263519.
%e A263512 Some solutions for n=3
%e A263512 ..0..1..3..7....0..1..6..7....0..1..6..7....0..1..2..3....0..1..3..7
%e A263512 ..8..4..2..6....5..4..2..3....4..5..2..3....4..6..5..7....4..5..2..6
%e A263512 .12..5.11.10....8.13.14.10....8..9.10.11....9..8.11.10....9..8.11.10
%e A263512 .13..9.14.15...12..9.15.11...12.13.14.15...13.12.15.14...13.12.14.15
%Y A263512 Cf. A263519.
%K A263512 nonn
%O A263512 1,1
%A A263512 _R. H. Hardin_, Oct 19 2015

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.