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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A207795 Number of (n+1) X 5 0..3 arrays with every 2 X 3 or 3 X 2 subblock having an unequal number of clockwise and counterclockwise edge increases. 1
 184416, 11074704, 748331168, 51169273632, 3518595143968, 242220624640736, 16680713033508736, 1148811345615228256, 79121030418834528800, 5449257821732256157760, 375304130593754696515744 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Column 4 of A207799. LINKS R. H. Hardin, Table of n, a(n) for n = 1..144 EXAMPLE Some solutions for n=3: ..1..2..1..1..0....0..1..0..2..2....3..1..3..2..2....3..3..0..0..3 ..0..2..2..3..1....0..1..3..0..1....1..1..0..3..0....3..3..2..1..0 ..0..0..3..2..1....0..2..1..0..1....2..3..1..1..3....1..0..1..1..2 ..1..2..1..1..2....3..3..0..2..1....2..2..1..1..2....0..0..3..2..2 CROSSREFS Sequence in context: A233956 A249232 A086478 * A228677 A268853 A024754 Adjacent sequences:  A207792 A207793 A207794 * A207796 A207797 A207798 KEYWORD nonn AUTHOR R. H. Hardin, Feb 20 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 December 4 17:50 EST 2021. Contains 349526 sequences. (Running on oeis4.)