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.

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

This page as a plain text file.
%I A263969 #7 Nov 10 2015 10:27:54
%S A263969 20,72,1441,13856,189993,2215960,28027420,340646784,4224499865,
%T A263969 51860834624,639939698625,7875999490880,97061605202532,
%U A263969 1195356109670056,14726359450425633,181392031870723936,2234494271219028681
%N A263969 Number of (n+1)X(2+1) arrays of permutations of 0..n*3+2 with each element having index change (+-,+-) 0,2 1,1 or 1,0.
%C A263969 Column 2 of A263973.
%H A263969 R. H. Hardin, <a href="/A263969/b263969.txt">Table of n, a(n) for n = 1..210</a>
%F A263969 Empirical: a(n) = 7*a(n-1) +80*a(n-2) -135*a(n-3) -591*a(n-4) +752*a(n-5) -823*a(n-6) -415*a(n-7) +768*a(n-8) -81*a(n-9) -9*a(n-10)
%e A263969 Some solutions for n=4
%e A263969 ..2..3..0....4..3..0....2..5..0....2..3..0....2..5..4....3..4..0....2..3..0
%e A263969 ..6..1..7....5..2..1....7..1..3....6..7..1....0..1..8....6..2..1....1..6..7
%e A263969 ..8..4..5....8.11..6...10..4..6....8..4..5....3.11..6....9.11..5....8..5..4
%e A263969 .12.13.14....7.13.14...11.13..8...12.14.13...12..7.13....7..8.13...11.12.13
%e A263969 ..9.10.11...10..9.12...14..9.12....9.10.11...14..9.10...14.10.12...14..9.10
%Y A263969 Cf. A263973.
%K A263969 nonn
%O A263969 1,1
%A A263969 _R. H. Hardin_, Oct 30 2015