login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A264004
Number of (1+1) X (n+1) arrays of permutations of 0..n*2+1 with each element having index change (+-,+-) 0,0 1,2 or 1,0.
2
4, 18, 81, 288, 1024, 3872, 14641, 54450, 202500, 756450, 2825761, 10543232, 39337984, 146821248, 547981281, 2045057058, 7632119044, 28483593842, 106302733681, 396726688800, 1480602240000, 5525684704800, 20622143227921
OFFSET
1,1
COMMENTS
Row 1 of A264003.
LINKS
FORMULA
Empirical: a(n) = 4*a(n-1) - 4*a(n-2) + 12*a(n-3) - 12*a(n-5) + 4*a(n-6) - 4*a(n-7) + a(n-8).
Empirical g.f.: x*(4 + 2*x + 25*x^2 - 12*x^3 - 20*x^4 + 4*x^5 - 7*x^6 + 2*x^7) / ((1 - x)*(1 + x)*(1 - 4*x + x^2)*(1 + 4*x^2 + x^4)). - Colin Barker, Mar 20 2018
EXAMPLE
Some solutions for n=4:
..0..1..7..3..9....0..8..7..6..4....0..6..9..8..7....0..6..9..8..7
..5..6..4..8..2....5..3..2..1..9....5..3..2..1..4....5..1..4..3..2
CROSSREFS
Cf. A264003.
Sequence in context: A104631 A106391 A063881 * A282708 A252823 A264191
KEYWORD
nonn
AUTHOR
R. H. Hardin, Oct 31 2015
STATUS
approved