Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118601
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118601 Number of monoids (semigroups with identity) of order <= n. +0
1
1, 3, 10, 45, 273, 2510, 34069 (list; graph; listen)
OFFSET

1,2

COMMENT

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)).

CROSSREFS

Cf. A001329, A001423, A001426, A023814, A027851, A029851, A058108, A058132, A058133, A063756, A079173, A118581.

Sequence in context: A077002 A003704 A000250 this_sequence A005143 A121138 A074508

Adjacent sequences: A118598 A118599 A118600 this_sequence A118602 A118603 A118604

KEYWORD

hard,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research