login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A206115 Number of (n+1) X 6 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases. 1
171564, 588840, 2408480, 21702240, 190349280, 1990281312, 18371031840, 163028308320, 1709651647008, 15780716350560, 140041316846880, 1468590764779872, 13555635345131040, 120295491171469920 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Column 5 of A206118.

LINKS

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

FORMULA

Empirical: a(n) = 859*a(n-3) for n>8.

EXAMPLE

Some solutions for n=4:

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

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

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

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

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

CROSSREFS

Sequence in context: A234088 A236498 A246227 * A204730 A049053 A242980

Adjacent sequences:  A206112 A206113 A206114 * A206116 A206117 A206118

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 January 19 14:53 EST 2020. Contains 331049 sequences. (Running on oeis4.)