The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A271678 Number of ways to move elements of an n X n X n triangular array to themselves or a neighbor, with no more than 2-1 elements moved to themselves. 0
1, 5, 22, 532, 19448, 2249488, 556148184, 357523207792, 546128923805904, 2069530459322561760, 19127220928721943633120 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Column 2 of A271684.
LINKS
EXAMPLE
Some solutions for n=4
.....5........0........5........6........0........5........5........5
....4.1......4.6......5.1......2.5......4.3......2.5......2.5......4.1
...5.3.3....5.1.6....4.6.1....2.4.6....5.5.3....6.3.1....6.2.5....6.0.5
..4.4.4.1..2.2.3.3..4.3.4.1..0.1.3.3..2.4.4.1..0.4.4.1..2.3.2.0..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. A271684.
Sequence in context: A298322 A299215 A300031 * A002069 A298233 A215742
KEYWORD
nonn
AUTHOR
R. H. Hardin, Apr 12 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 May 13 11:22 EDT 2024. Contains 372504 sequences. (Running on oeis4.)