Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Revision History for A118601

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
#6 by N. J. A. Sloane at Wed May 01 21:10:55 EDT 2013
EXTENSIONS

Edited by _N. J. A. Sloane, _, Jul 25 2009

Discussion
Wed May 01
21:10
OEIS Server: https://oeis.org/edit/global/1900
#5 by Russ Cox at Fri Mar 30 18:40:37 EDT 2012
AUTHOR

_Jonathan Vos Post (jvospost3(AT)gmail.com), _, May 08 2006

EXTENSIONS

One more term from _Jonathan Vos Post (jvospost3(AT)gmail.com), _, Jul 20 2009

Discussion
Fri Mar 30
18:40
OEIS Server: https://oeis.org/edit/global/228
#4 by N. J. A. Sloane at Tue Jun 01 03:00:00 EDT 2010
NAME

Number of monoids (semigroups with identity) of order <= n.

Partial sums of A058129.

DATA

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

COMMENTS

Monoid analogue of A063756 Number of groups of order <= n. See also A118581 Number of nonisomorphic semigroups 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. A118581 assumes that a semigroup may be empty and need not have an identity. This sequence, however, requires an identity and thus cannot be empty.

KEYWORD

hard,nonn,new

EXTENSIONS

One more term from Jonathan Vos Post (jvospost3(AT)gmail.com), Jul 20 2009

Edited by N. J. A. Sloane, Jul 25 2009

#3 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
COMMENTS

Monoid analogue of A063756 Number of groups of order <= n. See also A118581 Number of nonisomorphic semigroups 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. A118581 assumes that a semigroup may be empty, and need not have an identity. This sequence, however, requires an identity, and thus cannot be empty.

KEYWORD

hard,nonn,new

#2 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009
KEYWORD

hard,nonn,new

AUTHOR

Jonathan Vos Post (jvospost2jvospost3(AT)yahoogmail.com), May 08 2006

#1 by N. J. A. Sloane at Fri May 19 03:00:00 EDT 2006
NAME

Number of monoids (semigroups with identity) of order <= n.

DATA

1, 3, 10, 45, 273, 2510, 34069

OFFSET

1,2

COMMENTS

Monoid analogue of A063756 Number of groups of order <= n. See also A118581 Number of nonisomorphic semigroups 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. A118581 assumes that a semigroup may be empty, and need not have an identity. This sequence, however, requires an identity, and thus cannot be empty.

FORMULA

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

KEYWORD

hard,nonn,new

AUTHOR

Jonathan Vos Post (jvospost2(AT)yahoo.com), May 08 2006

STATUS

approved