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.

A383871 Number of labeled 3-nilpotent semigroups of order n.

Original entry on oeis.org

0, 0, 6, 180, 11720, 3089250, 5944080072, 147348275209800, 38430603831264883632, 90116197775746464859791750, 2118031078806486819496589635743440, 966490887282837500134221233339527160717340, 17165261053166610940029331024343115375665769316911576, 6444206974822296283920298148689544172139277283018112679406098010
Offset: 1

Views

Author

Elijah Beregovsky, May 13 2025

Keywords

Comments

A semigroup S is nilpotent if there exists a natural number r such that the set S^r of all products of r elements of S has size 1.
If r is the smallest such number, then S is said to have nilpotency degree r.
This sequence counts semigroups S that have an element e such that for all x,y,z in S x*y*z = e.
In 1976 Kleitman, Rothschild and Spencer gave an argument asserting that the proportion of 3-nilpotent semigroups, amongst all semigroups of order n, is asymptotically 1. Later opinion regards their argument as incomplete, and no satisfactory proof has been found.

References

  • H. Jürgensen, F. Migliorini, and J. Szép, Semigroups. Akadémiai Kiadó (Publishing House of the Hungarian Academy of Sciences), Budapest, 1991.

Crossrefs

Formula

a(n) = Sum_{2 <= m <= b(n)} binomial(n,m) * m * Sum_{0 <= i <= m-1} (-1)^i * binomial(m-1,i) * (m-i)^((n-m)^2), where b(n) = floor(n + 1/2 - sqrt(n-3/4)).