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!)
A271962 Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no more than 1-1 2-cycles. 0
1, 3, 23, 445, 23145, 3135539, 1120710711, 1054066365149, 2612720914804105, 17070666122786078979, 294119848655438573724167 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Column 1 of A271969.

LINKS

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

EXAMPLE

Some solutions for n=4

.....5........0........0........6........5........6........5........0

....6.1......0.6......4.5......2.6......6.1......2.3......5.1......5.3

...5.6.1....0.2.6....2.6.0....2.5.6....6.6.1....5.3.6....5.4.1....6.2.6

..4.1.2.0..0.2.3.3..0.1.3.0..0.1.1.3..2.3.4.1..4.2.2.3..4.4.1.0..0.2.2.3

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: A133338 A298466 A116986 * A268668 A171777 A154896

Adjacent sequences:  A271959 A271960 A271961 * A271963 A271964 A271965

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 July 28 19:33 EDT 2021. Contains 346335 sequences. (Running on oeis4.)