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-9 of 9 results.

A027851 Number of nonisomorphic semigroups of order n.

Original entry on oeis.org

1, 1, 5, 24, 188, 1915, 28634, 1627672, 3684030417, 105978177936292
Offset: 0

Views

Author

Christian G. Bower, Dec 13 1997, updated Feb 19 2001

Keywords

Crossrefs

Formula

a(n) = A001423(n)*2 - A029851(n).
a(n) + A079173(n) = A001329(n).

Extensions

a(8)-a(9) from Andreas Distler, Jan 13 2011

A058116 Triangle read by rows: T(n,k) is the number of isomorphism classes of commutative semigroups of order n with k idempotents.

Original entry on oeis.org

1, 2, 1, 5, 5, 2, 16, 23, 14, 5, 62, 106, 93, 49, 15, 342, 544, 582, 422, 200, 53, 3435, 3380, 3773, 3360, 2178, 943, 222, 97061, 30788, 27222, 26625, 21283, 12676, 5072, 1078
Offset: 1

Views

Author

Christian G. Bower, Nov 09 2000

Keywords

Examples

			Triangle begins:
   1;
   2,   1;
   5,   5,  2;
  16,  23, 14,  5;
  62, 106, 93, 49, 15;
  ...
		

Crossrefs

Row sums give A001426.
Main diagonal is A006966(n+1).
Column 1 is A058117.
The labeled version is A058167.

Extensions

a(29)-a(36) from Andrew Howroyd, Jan 27 2022

A058112 Number of isomorphism classes of idempotent semigroups of order n.

Original entry on oeis.org

1, 1, 3, 10, 46, 251, 1682, 13213, 119826, 1228712
Offset: 0

Views

Author

Christian G. Bower, Nov 09 2000

Keywords

Crossrefs

Main diagonal of A058108 and A058137.
Cf. A027851, A351730 (labeled).

Extensions

Updated Feb 19 2001
a(8)-a(9) added by Andrew Howroyd, Feb 17 2022

A058109 Semigroups of order n with 1 idempotent.

Original entry on oeis.org

1, 2, 5, 20, 171, 5284, 1224331
Offset: 1

Views

Author

Christian G. Bower, Nov 09 2000

Keywords

Crossrefs

Column 1 of A058108.

Extensions

Updated Feb 19 2001

A058111 Number of semigroups of order n with 3 idempotents.

Original entry on oeis.org

10, 72, 590, 5422, 61323
Offset: 3

Views

Author

Christian G. Bower, Nov 09 2000

Keywords

Crossrefs

Column 3 of A058108.

Extensions

Updated Feb 19 2001

A118581 Number of nonisomorphic semigroups of order <= n.

Original entry on oeis.org

1, 2, 7, 31, 219, 2134, 30768, 1658440, 3685688857, 105981863625149
Offset: 0

Views

Author

Jonathan Vos Post, May 07 2006

Keywords

Comments

Semigroup analog of A063756 Number of groups of order <= n. a semigroup is an algebraic structure consisting of a set S closed under an associative binary operation (and thus is an associative groupoid). Some sources require that a semigroup have an identity element (in which case semigroups are identical to monoids). Not all sources agree that S should be nonempty. This sequence assumes that a semigroup may be empty and need not have an identity.

Examples

			a(7) = 1658440 = 1 + 1 + 5 + 24 + 188 + 1915 + 28634 + 1627672.
		

Crossrefs

Formula

a(n) = Sum_{i=0..n} A027851(i). a(n) = Sum_{i=0..n} (2*A001423(i) - A029851(i)).

Extensions

a(8)-a(9) (using A027851) from Giovanni Resta, Jun 16 2016

A118601 Partial sums of A058129.

Original entry on oeis.org

1, 3, 10, 45, 273, 2510, 34069, 1703066
Offset: 1

Views

Author

Jonathan Vos Post, May 08 2006

Keywords

Crossrefs

Formula

a(n) = SUM[i=1..n] A058129(i). a(n) = SUM[i=1..n] (2*A058133(i) - A058132(i)).

Extensions

One more term from Jonathan Vos Post, Jul 20 2009
Edited by N. J. A. Sloane, Jul 25 2009

A058110 Semigroups of order n with 2 idempotents.

Original entry on oeis.org

3, 9, 50, 309, 2806, 58583
Offset: 2

Views

Author

Christian G. Bower, Nov 09 2000

Keywords

Crossrefs

Column 2 of A058108.

Extensions

Updated Feb 19 2001

A186117 Number of nonisomorphic semigroups of order n minus number of groups of order n.

Original entry on oeis.org

0, 4, 23, 186, 1914, 28632, 1627671, 3684030412, 105978177936290
Offset: 1

Views

Author

Jonathan Vos Post, Feb 13 2011

Keywords

Comments

In a sense, this measures the increase in combinatorial structures available by dropping the requirement of inverses, and an identity element, in moving from the group axioms to the semigroup axioms. A semigroup is mathematical object defined for a set and a binary operator in which the multiplication operation is associative. No other restrictions are placed on a semigroup; thus a semigroup need not have an identity element and its elements need not have inverses within the semigroup. Other sequences may be derived by considering commutative semigroups and commutative groups, self-converse semigroup, counting idempotents, and the like.

Examples

			a(1) = 0 because there are unique groups and semigroups of order 1, so 1 - 1  = 0.
a(2) = 4 because there are 5 semigroups of order 2 groups and a unique group of order 2, so 5 - 1  = 4.
		

Crossrefs

Formula

a(n) = A027851(n) - A000001(n).
Showing 1-9 of 9 results.