The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A271963 Number of ways to move elements of an nXnXn triangular array to themselves or a neighbor, with no more than 2-1 2-cycles. 0
 1, 6, 44, 1207, 74247, 12282848, 5228980482, 5803552280765, 16782493037010409, 126714630730645970274 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Column 2 of A271969. LINKS EXAMPLE Some solutions for n=4 .....0........0........0........0........5........5........0........5 ....0.0......5.3......0.0......0.0......4.1......6.1......4.3......4.1 ...0.5.3....4.5.1....0.0.0....0.5.0....5.0.6....0.2.5....5.3.0....0.0.0 ..0.4.2.0..0.4.2.0..0.0.4.3..0.2.0.0..4.1.0.1..0.0.4.1..4.2.0.0..0.4.3.0 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: A295978 A194928 A267074 * A065783 A158460 A077672 Adjacent sequences:  A271960 A271961 A271962 * A271964 A271965 A271966 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.

Last modified December 3 14:51 EST 2020. Contains 338906 sequences. (Running on oeis4.)