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!)
A271845 Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no 2-cycles and with no more than 1-1 elements moved to themselves. 0

%I #4 Apr 15 2016 18:44:30

%S 0,2,2,42,580,31892,3193380,800156720,442390366776,566421064781268,

%T 1649994557114019556

%N Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no 2-cycles and with no more than 1-1 elements moved to themselves.

%C Column 1 of A271852.

%e Some solutions for n=4

%e .....6........6........5........5........6........5........5........5

%e ....2.6......2.3......6.1......6.1......2.5......4.1......6.1......6.1

%e ...6.1.6....4.5.5....5.2.6....6.2.5....2.5.6....4.4.6....5.6.1....5.2.5

%e ..2.3.1.3..2.3.4.1..4.1.2.3..2.3.4.1..2.3.2.3..2.3.3.3..4.1.4.1..4.1.4.1

%e Element moves: 0=itself 1=nw 2=ne 3=w 4=e 5=sw 6=se, reciprocals total 7

%Y Cf. A271852.

%K nonn

%O 1,2

%A _R. H. Hardin_, Apr 15 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 4 09:58 EST 2024. Contains 370528 sequences. (Running on oeis4.)