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.

User: Josaphat Baolahy

Josaphat Baolahy's wiki page.

Josaphat Baolahy has authored 1 sequences.

A371560 a(n) = n!*(n+1)!^3.

Original entry on oeis.org

1, 8, 432, 82944, 41472000, 44789760000, 92177326080000, 330363536670720000, 1926680145863639040000, 17340121312772751360000000, 230797014673005320601600000000, 4386989654904485133995212800000000, 115658595261901846072649790259200000000
Offset: 0

Views

Author

Josaphat Baolahy, Mar 27 2024

Keywords

Comments

6*a(n) is the number of elements of the wreath product of S_n and S_4 with cycle partition equal to (4n).

Crossrefs

Cf. A000142, A224900.

Programs

  • Python
    from math import factorial
def A371560(n): return factorial(n)**4*(n+1)**3 # Chai Wah Wu, Apr 22 2024
  • SageMath
    def a(n): return factorial(n-1)*(factorial(n)**(4-1))

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.