login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264879 Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 with each element having directed index change 0,1 0,-1 -2,0 or 1,1. 2

%I #4 Nov 27 2015 07:35:30

%S 1,0,1,1,7,20,49,175,323,1085,2290,6489,15751,41749,105514,276079,

%T 706396,1825615,4714184,12103729,31297188,80431077,207561706,

%U 534335127,1377615603,3548250067,9145959294,23561913471,60719538527,156456169973

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

%C Row 2 of A264878.

%H R. H. Hardin, <a href="/A264879/b264879.txt">Table of n, a(n) for n = 1..210</a>

%F Empirical: a(n) = 10*a(n-2) +6*a(n-3) -42*a(n-4) -40*a(n-5) +117*a(n-6) +143*a(n-7) -222*a(n-8) -266*a(n-9) +272*a(n-10) +266*a(n-11) -222*a(n-12) -143*a(n-13) +117*a(n-14) +40*a(n-15) -42*a(n-16) -6*a(n-17) +10*a(n-18) -a(n-20)

%e All solutions for n=4

%e .10..2.12..4.14

%e ..6..0..1..9..3

%e .11..5.13..7..8

%Y Cf. A264878.

%K nonn

%O 1,5

%A _R. H. Hardin_, Nov 27 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)