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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206142 Number of (n+1) X (n+1) 0..2 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases. 1
 81, 246, 7812, 580986, 101596896, 41869995708, 40724629633188, 93574975249028022, 508279521493590763140, 6529777647254616589112172, 198475392061658571459051861720, 14277440032279343277552357109481028 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A206150. LINKS R. H. Hardin, Table of n, a(n) for n = 1..13 EXAMPLE Some solutions for n=4: ..2..1..0..2..1....0..2..1..2..0....1..2..0..2..0....0..1..0..1..2 ..0..2..1..0..2....1..0..2..1..2....0..1..2..1..2....1..0..1..0..1 ..1..0..2..1..0....0..2..1..0..1....1..2..0..2..0....0..1..0..1..2 ..2..1..0..2..1....1..0..2..1..0....0..1..2..0..2....1..2..1..2..1 ..0..2..1..0..2....2..1..0..2..1....1..0..1..2..1....0..1..0..1..2 CROSSREFS Sequence in context: A044986 A237160 A236886 * A225027 A225020 A219131 Adjacent sequences:  A206139 A206140 A206141 * A206143 A206144 A206145 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 May 23 14:57 EDT 2022. Contains 353975 sequences. (Running on oeis4.)