login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A271964 Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no more than 3-1 2-cycles. 0
1, 6, 59, 1828, 133056, 25994687, 12952862226, 16738437591113, 55931128658191675, 484527223323003786960 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Column 3 of A271969.

LINKS

Table of n, a(n) for n=1..10.

EXAMPLE

Some solutions for n=4

.....5........5........5........0........5........5........5........0

....2.6......2.6......5.1......0.5......4.1......2.5......5.1......6.0

...6.2.3....4.5.1....6.2.0....5.5.1....5.6.0....6.3.1....5.4.1....6.1.5

..2.3.4.3..0.1.0.0..0.2.0.0..2.4.2.0..2.0.1.0..0.4.2.0..4.2.4.3..2.3.4.1

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

CROSSREFS

Cf. A271969.

Sequence in context: A053987 A024270 A024271 * A237576 A229097 A217399

Adjacent sequences:  A271961 A271962 A271963 * A271965 A271966 A271967

KEYWORD

nonn

AUTHOR

R. H. Hardin, Apr 17 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 2 09:22 EDT 2021. Contains 346422 sequences. (Running on oeis4.)