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.

Showing 1-2 of 2 results.

A100540 Total number of Latin 4-dimensional hypercubes (Latin polyhedra) of order n.

Original entry on oeis.org

1, 2, 48, 36972288, 52260618977280
Offset: 1

Views

Author

Toru Ito (t_ito(AT)mue.biglobe.ne.jp), Nov 28 2004

Keywords

References

  • T. Ito, Method, equipment,program and storage media for producing tables, Publication number JP2004-272104A, Japan Patent Office (in Japanese).

Crossrefs

A row of the array in A249026.

Extensions

a(5) from Ian Wanless, May 01 2008
Edited by N. J. A. Sloane, Dec 05 2009 at the suggestion of Vladeta Jovovic

A211214 Number of reduced Latin n-dimensional hypercubes of order 4; labeled n-ary loops of order 4 with fixed identity.

Original entry on oeis.org

1, 1, 4, 64, 7132, 201538000, 432345572694417712, 3987683987354747642922773353963277968, 678469272874899582559986240285280710364867063489779510427038722229750276832
Offset: 0

Views

Author

Denis S. Krotov and Vladimir N. Potapov, Apr 06 2012

Keywords

Comments

The values are calculated recursively, based on the characterization by 2009. The number a(5) was found before (2001 and, independently, later works) by exhaustive computer-aided classification of the objects.

Crossrefs

Formula

a(n) = A211215(n)/(4*6^n).
Showing 1-2 of 2 results.