A267342 - OEIS

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

A267342

Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any north, west or southwest neighbors modulo n and the upper left element equal to 0.

1, 126, 77, 388, 4462, 96291, 3534075, 214106961 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`1,2`
	COMMENTS	`Superdiagonal 3 of A267338.`
	LINKS	`Table of n, a(n) for n=1..8.`
	EXAMPLE	`Some solutions for n=4` `..0..0..1..2..3..3..0....0..1..1..2..2..2..3....0..1..2..3..3..0..1` `..0..1..1..2..3..3..0....0..1..1..2..2..3..3....1..2..3..3..0..1..2` `..1..1..2..2..3..3..0....0..1..1..2..3..3..0....2..3..3..0..0..1..2` `..1..2..2..2..3..0..1....0..1..2..3..3..0..0....2..3..0..0..1..1..2`
	CROSSREFS	`Cf. A267338.` `Sequence in context: A267199 A348898 A267403 * A278935 A267395 A176303` `Adjacent sequences: A267339 A267340 A267341 * A267343 A267344 A267345`
	KEYWORD	`nonn`
	AUTHOR	`R. H. Hardin, Jan 13 2016`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 26 23:26 EDT 2023. Contains 361553 sequences. (Running on oeis4.)