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!)
A263587 Number of (1+1) X (n+1) arrays of permutations of 0..n*2+1 filled by rows with each element moved a city block distance of 1 or 2, and rows and columns in increasing lexicographic order. 1
1, 6, 12, 31, 89, 230, 536, 1171, 2439, 4882, 9470, 17935, 33331, 60994, 110208, 197059, 349285, 614522, 1074316, 1867855, 3232059, 5569206, 9560842, 16359331, 27909479, 47487870, 80606196, 136522471, 230766449, 389355662, 655827200 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
Empirical: a(n) = 4*a(n-1) - 5*a(n-2) + 2*a(n-3) - 2*a(n-5) + 3*a(n-6) - a(n-8) for n>9.
Empirical g.f.: x*(1 + 2*x - 7*x^2 + 11*x^3 + 13*x^4 + 7*x^5 + 8*x^6 + 5*x^7 + 2*x^8) / ((1 - x)^2*(1 + x^2)*(1 - x - x^2)^2). - Colin Barker, Jan 02 2019
EXAMPLE
Some solutions for n=4:
..1..3..6..8..9....1..5..7..8..9....2..5..6..8..9....1..2..3..8..9
..7..0..5..2..4....6..0..2..3..4....7..0..1..3..4....6..0..5..4..7
CROSSREFS
Row 1 of A263586.
Sequence in context: A152522 A096356 A065992 * A085611 A122608 A268283
KEYWORD
nonn
AUTHOR
R. H. Hardin, Oct 22 2015
STATUS
approved

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 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)