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!)
A206113 Number of (n+1) X 4 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases. 1
6028, 22624, 88596, 520800, 2408480, 10792800, 59892000, 276975200, 1241172000, 6887580000, 31852148000, 142734780000, 792071700000, 3662997020000, 16414499700000, 91088245500000, 421244657300000, 1887667465500000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 3 of A206118.

LINKS

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

FORMULA

Empirical: a(n) = 115*a(n-3) for n>6.

EXAMPLE

Some solutions for n=4:

..0..1..1..2....3..2..2..3....0..0..1..3....1..0..0..2....3..2..0..2

..1..1..2..0....0..3..2..2....3..0..0..1....3..1..0..0....2..0..0..2

..1..2..0..0....0..0..3..2....2..3..0..0....3..3..1..0....0..0..1..3

..2..0..0..2....2..0..0..3....2..2..3..0....0..3..3..1....0..1..3..3

..0..0..1..3....3..1..0..3....3..2..2..3....1..0..3..3....1..3..3..0

CROSSREFS

Sequence in context: A031605 A239176 A236975 * A237864 A031821 A203352

Adjacent sequences:  A206110 A206111 A206112 * A206114 A206115 A206116

KEYWORD

nonn

AUTHOR

R. H. Hardin, Feb 03 2012

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 December 1 09:39 EST 2021. Contains 349426 sequences. (Running on oeis4.)