A206135 - OEIS

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

A206135

Number of (n+1) X 7 0..3 arrays with every 2 X 3 or 3 X 2 subblock having exactly three counterclockwise and three clockwise edge increases.

797996, 241927532, 75353928196, 23692759265020, 7476894104333060, 2363085244017636372, 747324517604795047052, 236402993427571147646868, 74790182365485126434100812, 23662267614587185373925151692 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,1`
	COMMENTS	`Column 6 of A206137.`
	LINKS	`R. H. Hardin, Table of n, a(n) for n = 1..210`
	EXAMPLE	`Some solutions for n=4:` `..2..0..2..1..2..3..0....0..1..2..0..1..2..1....1..0..1..2..3..2..0` `..0..1..0..3..0..1..2....1..2..3..1..0..1..0....2..1..0..1..2..3..1` `..3..0..3..2..3..0..1....0..1..2..3..2..3..1....1..0..2..3..0..2..3` `..1..2..0..3..2..3..0....3..0..1..2..3..0..3....2..1..3..0..1..0..1` `..0..1..2..1..0..1..3....2..3..0..1..2..3..2....3..2..0..3..0..3..0`
	CROSSREFS	`Sequence in context: A151561 A022203 A234784 * A237543 A053086 A106781` `Adjacent sequences: A206132 A206133 A206134 * A206136 A206137 A206138`
	KEYWORD	`nonn`
	AUTHOR	`R. H. Hardin, Feb 04 2012`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 26 06:04 EDT 2023. Contains 361529 sequences. (Running on oeis4.)