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.

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

This page as a plain text file.
%I A264471 #4 Nov 14 2015 15:33:30
%S A264471 0,4,6,16,49,124,384,1041,2868,8189,22760,63910,179095,500979,1405340,
%T A264471 3935526,11024880,30892270,86537090,242454683,679254490,1902958308,
%U A264471 5331384633,14936238820,41845207329,117233159460,328438385380
%N A264471 Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having directed index change 0,1 1,0 2,1 or -1,-1.
%C A264471 Column 3 of A264476.
%H A264471 R. H. Hardin, <a href="/A264471/b264471.txt">Table of n, a(n) for n = 1..210</a>
%F A264471 Empirical: a(n) = 2*a(n-1) +a(n-2) +6*a(n-3) -6*a(n-4) +6*a(n-5) -27*a(n-6) +5*a(n-7) -9*a(n-8) +33*a(n-9) -4*a(n-10) +7*a(n-11) -12*a(n-12) +a(n-13) -a(n-14) +a(n-15)
%e A264471 Some solutions for n=4
%e A264471 ..5..0..1..2....5..6..7..2....5..0..7..2....5..6..7..2....5..6..7..2
%e A264471 ..9..4.11..3....0..4.11..3....9..1.11..3....0..1.11..3....9..4.11..3
%e A264471 .13.14.15..7...13..8..1.10...13.14.15.10...13..8.15.10...13..0..1.10
%e A264471 ..8.18.19..6...17.18.19.14....8..4.19..6...17..4.19.14....8.18.19.14
%e A264471 .12.16.17.10...12.16..9.15...12.16.17.18...12.16..9.18...12.16.17.15
%Y A264471 Cf. A264476.
%K A264471 nonn
%O A264471 1,2
%A A264471 _R. H. Hardin_, Nov 14 2015