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!)
A206117 Number of (n+1) X 8 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly two counterclockwise and two clockwise edge increases. 1
5538732, 16072760, 59892000, 1542266208, 18371031840, 373319837280, 10214794664928, 127417290645600, 2621909765268000, 72022987084456800, 901477331317620000, 18550011589271100000, 509562633622531860000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 7 of A206118.
LINKS
FORMULA
Empirical: a(n) = 7075*a(n-3) for n>10.
EXAMPLE
Some solutions for n=4:
..1..1..0..0..3..1..1..2....2..3..1..2..1..1..0..2....2..3..0..0..1..0..1..0
..0..0..2..0..0..2..1..1....3..3..1..1..2..1..1..0....3..0..0..2..0..0..1..1
..1..0..0..1..0..0..3..1....1..1..2..1..1..3..1..1....0..0..1..0..0..2..3..3
..3..1..0..0..1..0..0..2....3..1..1..0..1..1..2..1....3..3..0..0..1..3..3..0
..3..3..1..0..0..3..0..2....0..2..1..1..0..1..1..0....2..3..0..1..3..3..2..3
CROSSREFS
Sequence in context: A254188 A253800 A158760 * A237973 A204528 A092019
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 11:30 EDT 2024. Contains 371967 sequences. (Running on oeis4.)