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.

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

This page as a plain text file.
%I A264282 #4 Nov 10 2015 14:54:10
%S A264282 33,360,4189,47492,537057,6080234,68815948,778858184,8815152033,
%T A264282 99770013733,1129198689933,12780289656956,144647529389761,
%U A264282 1637123130312800,18528986663178389,209711377463378556
%N A264282 Number of (n+1)X(5+1) arrays of permutations of 0..n*6+5 with each element having directed index change 0,0 0,1 1,0 or -1,-2.
%C A264282 Column 5 of A264285.
%H A264282 R. H. Hardin, <a href="/A264282/b264282.txt">Table of n, a(n) for n = 1..210</a>
%F A264282 Empirical: a(n) = 13*a(n-1) -21*a(n-2) +41*a(n-3) -240*a(n-4) +363*a(n-5) -713*a(n-6) +1511*a(n-7) -1901*a(n-8) +3908*a(n-9) -2154*a(n-10) -2194*a(n-11) +13330*a(n-12) -23182*a(n-13) +22684*a(n-14) -11790*a(n-15) -5098*a(n-16) +19906*a(n-17) -28138*a(n-18) +26916*a(n-19) -18981*a(n-20) +10893*a(n-21) -5677*a(n-22) +2813*a(n-23) -1228*a(n-24) +419*a(n-25) -101*a(n-26) +15*a(n-27) -a(n-28)
%e A264282 Some solutions for n=4
%e A264282 ..0..1..2.11..3..5....0..1..2..3..4..5....8..0..1.11..3..4....8..0..1.11..3..5
%e A264282 .14.15..7..8..4.10....6..7.16..8..9.10....6..7..2.17..9..5....6..7..2..9..4.10
%e A264282 ..6.12.13..9.16.17...12.13.14.23.15.11...12.21.14.15.10.16...12.13.14.15.16.17
%e A264282 .26.19.28.20.21.23...18.27.19.21.22.17...26.13.19.20.22.23...18.27.19.21.22.23
%e A264282 .18.24.25.27.22.29...24.25.20.26.28.29...18.24.25.27.28.29...24.25.20.26.28.29
%Y A264282 Cf. A264285.
%K A264282 nonn
%O A264282 1,1
%A A264282 _R. H. Hardin_, Nov 10 2015