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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A263974 Number of (2+1)X(n+1) arrays of permutations of 0..n*3+2 with each element having index change (+-,+-) 0,2 1,1 or 1,0. 1
0, 72, 1817, 10720, 89472, 1791696, 27783305, 317382472, 3783068416, 51756812704, 698792225489, 8925688199152, 114042394336256, 1490898399253328, 19518200132035505, 253177516072868896, 3279883039710140160 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Row 2 of A263973.

LINKS

R. H. Hardin, Table of n, a(n) for n = 1..210

EXAMPLE

Some solutions for n=4

..5..3..4..1..9....2..6..4..1..9....6..3..8..9..2....6..5..0..8..2

..7..0.12..2.14...10..0..3.14..7....0..1.11..4.14...10.11..1..3..4

..6.13.10.11..8....5.13..8.11.12....5.13.10..7.12...12.13.14..7..9

CROSSREFS

Cf. A263973.

Sequence in context: A280807 A268749 A008659 * A344029 A187303 A268994

Adjacent sequences: A263971 A263972 A263973 * A263975 A263976 A263977

KEYWORD

nonn

AUTHOR

R. H. Hardin, Oct 30 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 December 1 07:34 EST 2022. Contains 358454 sequences. (Running on oeis4.)