login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,2
COMMENTS
Column 3 of A271969.
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
KEYWORD
nonn
AUTHOR
R. H. Hardin, Apr 17 2016
STATUS
approved