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.

A263971 Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 with each element having index change (+-,+-) 0,2 1,1 or 1,0.

This page as a plain text file.
%I A263971 #6 Nov 10 2015 10:29:14
%S A263971 465,10720,2604481,226810352,31702909989,3594130469760,
%T A263971 448695451459909,53640316831369632,6540831457433886617,
%U A263971 790462142954177461984,95918547752313363235977,11617678126362988189598288
%N A263971 Number of (n+1)X(4+1) arrays of permutations of 0..n*5+4 with each element having index change (+-,+-) 0,2 1,1 or 1,0.
%C A263971 Column 4 of A263973.
%H A263971 R. H. Hardin, <a href="/A263971/b263971.txt">Table of n, a(n) for n = 1..210</a>
%H A263971 R. H. Hardin, <a href="/A263971/a263971.txt">Empirical recurrence of order 53</a>
%F A263971 Empirical recurrence of order 53 (see link above)
%e A263971 Some solutions for n=2
%e A263971 ..2..3..4..1..8....6..7..0..8..2....5..6..4..1..8....2..6..4..9..8
%e A263971 .11..0..5.14..7....1.10.13..4..3....0..2.11.14..3....0.10..1.13..3
%e A263971 ..6.13.10..9.12...12..5.14.11..9...12.13.10..7..9....5..7.14.11.12
%Y A263971 Cf. A263973.
%K A263971 nonn
%O A263971 1,1
%A A263971 _R. H. Hardin_, Oct 30 2015