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!)
A271849 Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no 2-cycles and with no more than 5-1 elements moved to themselves. 0
1, 3, 22, 384, 15536, 1473994, 314196428, 149466458074, 157014841181820, 365217955668529232 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Column 5 of A271852.

LINKS

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

EXAMPLE

Some solutions for n=4

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

....6.3......5.1......6.3......6.3......4.5......5.3......4.5......6.3

...5.6.1....5.4.1....6.2.5....5.2.0....6.1.5....5.0.1....2.6.0....5.2.5

..4.1.2.0..4.4.1.0..2.3.4.1..4.1.0.0..2.3.4.1..4.4.2.0..2.3.3.0..4.1.4.1

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

CROSSREFS

Cf. A271852.

Sequence in context: A259919 A275366 A196734 * A271850 A156512 A119770

Adjacent sequences:  A271846 A271847 A271848 * A271850 A271851 A271852

KEYWORD

nonn

AUTHOR

R. H. Hardin, Apr 15 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 April 4 23:14 EDT 2020. Contains 333238 sequences. (Running on oeis4.)