login
This site is supported by donations to The OEIS Foundation.

 

Logo


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

%I

%S 0,4,2,1,16,16,16,68,97,128,328,548,838,1729,3056,5056,9536,17096,

%T 29441,53584,96144,168804,303114,542785,961504,1718224,3071248,

%U 5461836,9744865,17398576,30992536,55270596,98619022,175791233,313466656,559141632

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

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

%F Empirical: a(n) = 4*a(n-3) + 2*a(n-4) + 2*a(n-5) - 2*a(n-9) - a(n-10).

%F Empirical g.f.: x^2*(4 + 2*x + x^2 - 2*x^6 - x^7) / ((1 + x + x^2 - x^3 - x^4)*(1 - x - 2*x^3 - x^5 - x^6)). - _Colin Barker_, Jan 08 2019

%e All solutions for n=4:

%e .12.13.14..2..3

%e ..0..1..6..7..4

%e ..5.10.11..8..9

%Y Row 2 of A264534.

%K nonn

%O 1,2

%A _R. H. Hardin_, Nov 17 2015

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 19 23:36 EDT 2019. Contains 323411 sequences. (Running on oeis4.)