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

%I #3 Apr 17 2016 09:43:26

%S 1,6,44,1207,74247,12282848,5228980482,5803552280765,

%T 16782493037010409,126714630730645970274

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

%C Column 2 of A271969.

%e Some solutions for n=4

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

%e ....0.0......5.3......0.0......0.0......4.1......6.1......4.3......4.1

%e ...0.5.3....4.5.1....0.0.0....0.5.0....5.0.6....0.2.5....5.3.0....0.0.0

%e ..0.4.2.0..0.4.2.0..0.0.4.3..0.2.0.0..4.1.0.1..0.0.4.1..4.2.0.0..0.4.3.0

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

%Y Cf. A271969.

%K nonn

%O 1,2

%A _R. H. Hardin_, Apr 17 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.)