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

%I #3 Apr 17 2016 09:46:10

%S 1,6,61,2267,212647,56789048,39863591390,73862996725483,

%T 355179936399226357

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

%C Column 6 of A271969.

%e Some solutions for n=4

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

%e ....0.0......0.0......5.0......4.1......0.1......4.3......0.0......4.1

%e ...0.5.6....5.5.3....2.5.5....0.0.6....5.0.5....5.3.5....0.0.5....5.5.6

%e ..0.4.1.1..2.4.4.1..0.2.4.1..4.3.2.3..2.0.2.0..4.2.4.1..4.3.2.0..2.4.1.1

%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 February 29 00:26 EST 2024. Contains 370400 sequences. (Running on oeis4.)