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.

A118542 Number of nonisomorphic groupoids with <= n elements.

Original entry on oeis.org

1, 2, 12, 3342, 178985294, 2483527716080119, 14325590005802419238355799, 50976900301828909677297289506452525838, 155682086691137998248942804080553139214788341933547854
Offset: 0

Views

Author

Jonathan Vos Post, May 06 2006

Keywords

Comments

The number of isomorphism classes of closed binary operations on sets of order <= n. See formulas by Christian G. Bower in A001329 Number of nonisomorphic groupoids with n elements.

Examples

			a(5) = 1 + 1 + 10 + 3330 + 178981952 + 2483527537094825 = 2483527716080119 is prime.
		

Crossrefs

Formula

a(n) = SUM[i=0..n] A001329(i). a(n) = SUM[i=0..n] (A079173(i)+A027851(i)). a(n) = SUM[i=0..n] (A079177(i)+A079180(i)). a(n) = SUM[i=0..n] (A079183(i)+A001425(i)). a(n) = SUM[i=0..n] (A079187(i)+A079190(i)). a(n) = SUM[i=0..n] (A079193(i)+A079196(i)+A079199(i)+A001426(i)).