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

Revision History for A186117

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

Showing all changes.
Number of nonisomorphic semigroups of order n minus number of groups of order n.
(history; published version)
#8 by Russ Cox at Fri Mar 30 18:40:58 EDT 2012
AUTHOR

_Jonathan Vos Post (jvospost3(AT)gmail.com), _, Feb 13 2011

Discussion
Fri Mar 30
18:40
OEIS Server: https://oeis.org/edit/global/228
#7 by T. D. Noe at Mon Aug 15 18:58:42 EDT 2011
STATUS

editing

approved

#6 by T. D. Noe at Mon Aug 15 18:58:34 EDT 2011
LINKS

Eric W. Weisstein, <a href="http://mathworld.wolfram.com/FiniteGroup.html">Finite Group.</a> From MathWorld--A Wolfram Web Resource.

Eric W. Weisstein, <a href="http://mathworld.wolfram.com/Semigroup.html">Semigroup.</a> From MathWorld--A Wolfram Web Resource

STATUS

approved

editing

#5 by T. D. Noe at Sat Feb 26 15:30:09 EST 2011
STATUS

reviewed

approved

#4 by R. J. Mathar at Sat Feb 26 15:24:07 EST 2011
STATUS

proposed

reviewed

#3 by R. J. Mathar at Sat Feb 26 15:24:00 EST 2011
NAME

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

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.

KEYWORD

nonn,hard,less,changed

#2 by Jonathan Vos Post at Sun Feb 13 04:45:40 EST 2011
NAME

allocated for Jonathan Vos Post Number of nonisomorphic semigroups of order n - number of groups of order n.

DATA

0, 4, 23, 186, 1914, 28632, 1627671, 3684030412, 105978177936290

OFFSET

1,2

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.

LINKS

Eric W. Weisstein, <a href="http://mathworld.wolfram.com/FiniteGroup.html">Finite Group.</a> From MathWorld--A Wolfram Web Resource.

Eric W. Weisstein, <a href="http://mathworld.wolfram.com/Semigroup.html">Semigroup.</a> From MathWorld--A Wolfram Web Resource

FORMULA

a(n) = A027851(n) - A000001(n).

EXAMPLE

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.

KEYWORD

allocated

nonn,hard

AUTHOR

Jonathan Vos Post (jvospost3(AT)gmail.com), Feb 13 2011

STATUS

approved

proposed

Discussion
Wed Feb 16
03:20
T. D. Noe: With all due respect, this seems contrived to me. It's like subtracting apples from oranges.
#1 by Jonathan Vos Post at Sun Feb 13 04:45:40 EST 2011
NAME

allocated for Jonathan Vos Post

KEYWORD

allocated

STATUS

approved