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!)
A271846 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 2-1 elements moved to themselves. 0

%I #3 Apr 15 2016 18:44:53

%S 1,2,8,124,2782,168566,21337480,6300361544,4140011051160,

%T 6186584633824524

%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 2-1 elements moved to themselves.

%C Column 2 of A271852.

%e Some solutions for n=4

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

%e ....4.1......2.3......4.1......4.1......4.5......4.1......4.1......5.3

%e ...6.6.3....6.3.6....5.4.5....4.4.5....2.4.6....4.5.5....6.3.5....5.2.3

%e ..2.3.4.1..0.2.2.3..4.1.1.0..2.3.3.0..2.3.3.3..0.1.4.1..0.2.4.1..4.4.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 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)