# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a264158 Showing 1-1 of 1 %I A264158 #11 Mar 21 2018 06:42:32 %S A264158 4,10,29,89,260,772,2281,6741,19940,58954,174329,515481,1524232, %T A264158 4507072,13327105,39407393,116525124,344557218,1018833429,3012624481, %U A264158 8908135596,26340780436,77887982793,230309723973,681010947204,2013705293106 %N A264158 Number of (n+1) X (1+1) arrays of permutations of 0..n*2+1 with each element having directed index change 0,1 0,-1 0,2 1,0 -1,0 or 2,0. %C A264158 Column 1 of A264163. %H A264158 R. H. Hardin, Table of n, a(n) for n = 1..210 %F A264158 Empirical: a(n) = 2*a(n-1) + 2*a(n-2) + 2*a(n-3) + 4*a(n-5) - a(n-8). %F A264158 Empirical g.f.: x*(4 + 2*x + x^2 + 3*x^3 + 4*x^4 - x^6 - x^7) / (1 - 2*x - 2*x^2 - 2*x^3 - 4*x^5 + x^8). - _Colin Barker_, Mar 21 2018 %e A264158 Some solutions for n=4: %e A264158 ..1..0....1..0....1..3....2..3....2..3....1..0....2..0....2..0....1..0....1..3 %e A264158 ..4..5....3..2....0..2....0..1....0..1....3..2....3..5....4..1....4..5....0..5 %e A264158 ..2..3....5..7....5..7....5..7....6..7....5..4....6..1....6..3....2..3....6..7 %e A264158 ..7..9....4..6....4..9....4..9....4..5....8..9....8..9....8..5....8..9....2..9 %e A264158 ..6..8....9..8....6..8....6..8....9..8....6..7....4..7....9..7....6..7....4..8 %Y A264158 Cf. A264163. %K A264158 nonn %O A264158 1,1 %A A264158 _R. H. Hardin_, Nov 06 2015 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE