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!)
A206326 Number of (n+1) X 8 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly three clockwise edge increases. 1
43848120, 23340152044, 18627016493468, 15397943280509136, 12867047450502167660, 10794194502778261468304, 9069132565961324534394832, 7624474056591556590163290412, 6411545009003861373134720468216 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Column 7 of A206327.
LINKS
EXAMPLE
Some solutions for n=4
..0..2..0..0..3..3..0..3....3..0..1..2..2..2..1..0....3..0..3..0..1..0..1..0
..1..0..3..2..1..0..3..1....1..2..0..1..0..3..2..1....1..3..2..3..0..2..0..1
..2..1..0..3..2..1..0..3....2..3..1..2..1..0..3..2....3..2..3..0..2..0..3..0
..3..2..1..0..3..2..1..0....0..0..2..3..2..1..0..3....1..3..0..3..1..2..0..1
..1..3..2..1..0..3..2..1....2..0..3..0..3..2..1..0....2..0..1..0..2..3..1..3
CROSSREFS
Cf. A206327.
Sequence in context: A017504 A017636 A139029 * A172718 A270611 A049360
KEYWORD
nonn
AUTHOR
R. H. Hardin, Feb 06 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 July 20 05:30 EDT 2024. Contains 374441 sequences. (Running on oeis4.)