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!)
A271850 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 6-1 elements moved to themselves. 0
1, 3, 22, 408, 18860, 1996822, 484756640, 264090710890, 318643448832078, 849130639354784618 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Column 6 of A271852.
LINKS
EXAMPLE
Some solutions for n=4
.....0........5........6........5........0........6........0........6
....0.0......6.1......2.6......6.1......0.5......2.3......5.3......2.5
...4.4.5....5.6.1....0.1.3....6.4.1....5.3.1....0.4.6....4.6.1....2.5.0
..2.3.3.0..4.1.4.1..0.0.0.0..2.3.0.0..4.4.2.0..0.0.1.3..0.0.4.1..2.3.0.0
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: A275366 A196734 A271849 * A364844 A156512 A119770
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)