The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A205641 Number of (n+1)X8 0..3 arrays with every 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward and upward neighbors. 0
158804736, 13444055224, 4782966551464, 3046981775525932, 2083971490096234516, 1438784646024287898832, 995980221935339574016820, 690272631599920646789218256 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 7 of A205642.
LINKS
EXAMPLE
Some solutions for n=4:
..3..1..1..2..1..2..3..0....2..3..3..0..3..3..3..1....1..1..2..1..3..1..2..1
..3..2..2..2..0..1..2..2....2..3..0..0..3..0..3..3....1..2..2..1..1..1..2..1
..3..2..0..1..3..0..2..3....2..3..3..3..3..3..3..0....1..1..1..1..2..2..2..1
..2..2..3..0..1..0..2..3....2..2..2..2..2..2..3..3....3..1..0..1..1..1..1..1
..3..0..1..3..1..0..2..3....2..1..1..1..1..2..2..2....1..1..0..0..0..0..0..0
CROSSREFS
Sequence in context: A204605 A289248 A251489 * A118078 A365019 A151695
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 29 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 May 23 16:14 EDT 2024. Contains 372765 sequences. (Running on oeis4.)