cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A271611 Number of ways to reciprocally link elements of an n X n X n triangular array with themselves or a neighbor, with no more than 2 elements linked to themselves.

Original entry on oeis.org

1, 3, 17, 114, 240, 2238, 216318, 5622392, 20454036, 970623228, 1038614548176, 131929454285752, 1257138602103744, 316487245419538728, 3147612978951707912144, 2069163709506683013857472, 63184698521304672890081520, 85953148896748583125564477008
Offset: 1

Views

Author

R. H. Hardin, Apr 10 2016

Keywords

Comments

Column 2 of A271617.

Examples

			Some solutions for n=4
.....6........5........0........0........5........5........0........5
....5.1......2.6......4.3......4.3......2.0......2.5......5.0......2.6
...2.0.0....5.0.1....5.5.0....5.4.3....6.4.3....5.2.5....2.4.3....4.3.1
..4.3.4.3..2.0.4.3..2.2.4.3..2.0.4.3..0.1.4.3..2.0.2.0..4.3.4.3..0.0.4.3
Element moves: 0=itself 1=nw 2=ne 3=w 4=e 5=sw 6=se, reciprocals total 7
		

Crossrefs

Cf. A271617.

Extensions

a(15)-a(18) from Alois P. Heinz, Jun 15 2017