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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206136 Number of (n+1) X 8 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases. 1
 5085012, 3340355572, 2268967605164, 1560344155530612, 1078605317680077404, 747324517604795047052, 518342328616619031217028, 359698014444415101581399772, 249665914107637738650774896468 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 7 of A206137. LINKS R. H. Hardin, Table of n, a(n) for n = 1..75 EXAMPLE Some solutions for n=4: ..1..0..1..2..0..3..1..2....1..2..1..3..0..3..0..2....2..1..3..2..0..1..0..1 ..2..1..2..0..2..1..3..1....2..3..2..0..3..0..1..3....3..2..1..3..1..3..2..3 ..1..0..1..3..1..2..0..2....3..0..3..2..0..1..2..0....2..3..2..1..2..1..3..0 ..3..1..0..1..3..1..2..3....0..3..1..0..3..0..1..2....1..2..3..2..1..2..0..3 ..0..2..1..3..2..3..0..2....1..0..2..1..0..1..0..1....2..0..1..3..2..1..3..0 CROSSREFS Sequence in context: A034607 A015363 A234785 * A186624 A157844 A263039 Adjacent sequences: A206133 A206134 A206135 * A206137 A206138 A206139 KEYWORD nonn AUTHOR R. H. Hardin, Feb 04 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 2 02:53 EDT 2023. Contains 361723 sequences. (Running on oeis4.)