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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206110 Number of (n+1) X (n+1) 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases. 1
 256, 5228, 88596, 5048352, 190349280, 24408220320, 10214794664928, 3260439951760800, 3545593194352716000, 12774731370996169188000, 35992614807976653175327200, 345829680669306156240540420000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A206118. LINKS R. H. Hardin, Table of n, a(n) for n = 1..13 EXAMPLE Some solutions for n=4: ..3..3..1..1..3....0..0..3..0..0....0..0..1..0..1....1..0..0..2..1 ..0..0..2..1..1....1..0..0..1..0....0..1..0..0..1....2..1..0..0..2 ..1..0..0..2..1....2..1..0..0..2....2..0..0..2..3....2..2..1..0..0 ..3..1..0..0..2....2..2..1..0..0....0..0..2..3..3....3..2..2..1..0 ..3..3..1..0..0....0..2..2..1..0....2..2..3..3..1....1..0..2..2..1 CROSSREFS Sequence in context: A016804 A115111 A200790 * A196152 A113173 A223964 Adjacent sequences: A206107 A206108 A206109 * A206111 A206112 A206113 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 24 22:14 EDT 2023. Contains 365582 sequences. (Running on oeis4.)