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!)
A267835 Number of nX5 arrays of permutations of 5 copies of 0..n-1 with every element equal to or 1 greater than any northeast neighbor modulo n and the upper left element equal to 0. 0

%I #3 Jan 21 2016 08:06:08

%S 1,126,8013,456052,26266875,1578668020,100947966762,6887295213088

%N Number of nX5 arrays of permutations of 5 copies of 0..n-1 with every element equal to or 1 greater than any northeast neighbor modulo n and the upper left element equal to 0.

%C Column 5 of A267836.

%e Some solutions for n=3

%e ..0..0..1..0..1....0..0..2..1..1....0..2..2..0..2....0..2..1..1..2

%e ..0..1..1..1..2....1..2..2..1..2....2..0..0..0..1....0..1..2..2..2

%e ..2..2..2..0..2....2..0..1..0..0....1..1..1..1..2....1..0..0..0..1

%Y Cf. A267836.

%K nonn

%O 1,2

%A _R. H. Hardin_, Jan 21 2016

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 March 28 18:04 EDT 2024. Contains 371254 sequences. (Running on oeis4.)