# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a263813
Showing 1-1 of 1

%I A263813 #6 Nov 10 2015 10:09:23
%S A263813 572,18776,643905,21876416,744805993,25345430544,862592912860,
%T A263813 29356226845638,999073504952233,34001177520867776,1157152615158501081,
%U A263813 39381049330204238294,1340244200628057661340,45612154523649903001376
%N A263813 Number of (n+1)X(3+1) arrays of permutations of 0..n*4+3 with each element having index change (+-,+-) 0,0 0,1 0,2 or 1,0
%C A263813 Column 3 of A263816
%H A263813 R. H. Hardin, <a href="/A263813/b263813.txt">Table of n, a(n) for n = 1..210</a>
%F A263813 Empirical: a(n) = 30*a(n-1) +196*a(n-2) -1915*a(n-3) -3770*a(n-4) +30778*a(n-5) -14022*a(n-6) -75638*a(n-7) +75638*a(n-8) +14022*a(n-9) -30778*a(n-10) +3770*a(n-11) +1915*a(n-12) -196*a(n-13) -30*a(n-14) +a(n-15)
%e A263813 Some solutions for n=2
%e A263813 ..2..0..1..3....2..0..1..3....1..5..3..2....0..2..3..1....2..0..3..1
%e A263813 ..6..5..4..7....4..5..7..6....0..4..6.11....5..4..7..6....5..4..7.11
%e A263813 ..9..8.11.10...10..9..8.11....8..9.10..7....8..9.11.10....9..8..6.10
%Y A263813 Cf. A263816
%K A263813 nonn
%O A263813 1,1
%A A263813 _R. H. Hardin_, Oct 27 2015

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE