login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264209 Number of (3+1)X(n+1) arrays of permutations of 0..n*4+3 with each element having index change +-(.,.) 0,0 0,2 or 1,0. 1
25, 605, 14641, 223245, 3404025, 59040000, 1024000000, 17127328000, 286470082441, 4843377674701, 81887459590561, 1380241197441805, 23264438445654025, 392494549521588805, 6621779062667769361 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Row 3 of A264207.

LINKS

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

EXAMPLE

Some solutions for n=3

..2..1..0..3....2..3..0..1....2..3..6..1....0..5..2..3....2..3..0..1

..6..5..4..7....8..9..4..5....0..7..4..5....8..1..4.11....8..5..4..7

.10.11.14..9...10.13..6..7....8..9.10.11...12..9..6..7...10.13..6.11

..8.13.12.15...12.15.14.11...14.13.12.15...14.13.10.15...12..9.14.15

CROSSREFS

Cf. A264207.

Sequence in context: A170706 A170744 A218727 * A307145 A061614 A171330

Adjacent sequences:  A264206 A264207 A264208 * A264210 A264211 A264212

KEYWORD

nonn

AUTHOR

R. H. Hardin, Nov 08 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 29 21:32 EST 2021. Contains 349416 sequences. (Running on oeis4.)