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

 

Logo
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
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
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 16 08:55 EDT 2024. Contains 375959 sequences. (Running on oeis4.)