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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A206055 Number of (n+1)X(n+1) 0..3 arrays with every 2X3 or 3X2 subblock having exactly two clockwise edge increases 0
 256, 21140, 1278672, 111242648, 18209383140, 5567891627984, 3548796740666104, 4531526542739275184, 11370221346994594652040, 60827254093069565745485584, 666208249155797450019782873520, 14561819290550204381850004841878000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Diagonal of A206063 LINKS EXAMPLE Some solutions for n=4 ..2..2..2..0..1....2..3..3..1..3....1..0..0..0..0....1..3..0..3..3 ..3..0..3..0..0....1..1..2..3..3....3..1..2..1..1....3..0..0..2..0 ..1..1..2..3..3....1..1..3..3..0....3..0..1..1..0....0..0..1..3..3 ..1..1..3..3..0....0..3..3..1..1....3..1..1..2..1....1..2..3..3..2 ..3..2..3..0..1....1..3..2..1..1....3..1..2..3..0....1..3..3..0..3 CROSSREFS Sequence in context: A206181 A251968 A017116 * A237134 A205948 A309827 Adjacent sequences:  A206052 A206053 A206054 * A206056 A206057 A206058 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.

Last modified November 28 22:01 EST 2021. Contains 349415 sequences. (Running on oeis4.)