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.

Previous Showing 11-20 of 22 results. Next

A209401 Number of noncommutative rings with n elements.

Original entry on oeis.org

0, 0, 0, 2, 0, 0, 0, 18, 2, 0, 0, 4, 0, 0, 0, 228, 0, 4, 0, 4, 0, 0, 0, 36, 2, 0, 23, 4, 0, 0, 0
Offset: 1

Views

Author

Ben Branman, Mar 26 2012

Keywords

Comments

a(n)=0 if and only if n is squarefree.

Examples

			For n=8, there are 52 rings of order 8, 18 of which are noncommutative, so a(8)=18.
		

Crossrefs

Formula

a(n) = A027623(n) - A037289(n).

A342376 Number of non-commutative rings without 1 containing n elements.

Original entry on oeis.org

0, 0, 0, 2, 0, 0, 0, 17, 2, 0, 0, 4, 0, 0, 0, 215, 0, 4, 0, 4, 0, 0, 0, 35, 2, 0, 23, 4, 0, 0, 0
Offset: 1

Views

Author

Bernard Schott, Mar 10 2021

Keywords

Comments

A ring without 1 is still a ring, although sometimes called a rng, or a non-unital ring, or a pseudo-ring (see Wikipedia links).
These are rings in which multiplication has no unit, and where there is at least one pair of non-commuting elements.
a(n)=0 if and only if n is squarefree.

Examples

			For n=4, there are 11 rings of order 4, 2 of which are without 1 and non-commutative, so a(4)= 2. Note that for these 2 rings, the abelian group under addition is the commutative Klein group Z/2Z + Z/2Z. These two rings are the last two rings described in the link _Greg Dresden_ in reference: Ring 22.NC.1 and Ring 22.NC.2.
		

Crossrefs

Number of non-commutative rings: A127708 (with 1 containing n elements), this sequence (without 1 containing n elements), A209401 (with n elements).

Formula

a(n) = A209401(n) - A127708(n) = A342377(n) - A342375(n).
a(A005117(n)) = 0; a(A013929(n)) > 0.

Extensions

a(28) corrected by Des MacHale, Mar 20 2021

A037221 Number of near-rings (or nearrings) definable on cyclic group of order n.

Original entry on oeis.org

3, 5, 12, 10, 60, 24, 135, 222, 329, 139, 1749, 454, 2716, 3817
Offset: 2

Views

Author

Keywords

Crossrefs

Extensions

Corrected by Christof Noebauer (christof.noebauer(AT)algebra.uni-linz.ac.at), Sep 29 2000

A070932 Possible number of units in a finite (commutative or non-commutative) ring.

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 26, 27, 28, 30, 31, 32, 36, 40, 42, 44, 45, 46, 48, 49, 52, 54, 56, 58, 60, 62, 63, 64, 66, 70, 72, 78, 80, 81, 82, 84, 88, 90, 92, 93, 96, 98, 100
Offset: 1

Views

Author

Sharon Sela (sharonsela(AT)hotmail.com), May 24 2002

Keywords

Comments

This is a list of the numbers of units in R where R ranges over all finite commutative or non-commutative rings.
By considering the ring Z_n and the finite fields GF(q) this sequence contains the values of the Euler function phi(n) (A000010) and prime powers - 1 (A181062). By taking direct product of rings, if n and m belong to the sequence then so does m*n.
Eric M. Rains has shown that these rules generate all terms of this sequence. More precisely, he shows this sequence (with 0 removed) is the multiplicative monoid generated by all numbers of the form q^n-q^{n-1} for n >= 1 and q a prime power (see Rains link).
Since the number of units of F_q[X]/(X^n) is q^n - q^(n-1), restricting to finite commutative rings gives the same sequence. A296241, which is a proper supersequence, allows the ring R to be infinite. - Jianing Song, Dec 24 2021

Crossrefs

A000252 is a subsequence.
A282572 is the subsequence of odd terms.
Proper subsequence of A296241.
The main entries concerned with the enumeration of rings are A027623, A037234, A037291, A037289, A038538, A186116.

Programs

  • Mathematica
    max = 100; A000010 = EulerPhi[ Range[2*max]] // Union // Select[#, # <= max &] &; A181062 = Select[ Range[max], Length[ FactorInteger[#]] == 1 &] - 1; FixedPoint[ Select[ Outer[ Times, #, # ] // Flatten // Union, # <= max &] &, Union[A000010, A181062] ] (* Jean-François Alcover, Sep 10 2013 *)
  • PARI
    list(lim)=my(P=1, q, v, u=List()); forprime(p=2, default(primelimit), if(eulerphi(P*=p)>=lim, q=p; break)); v=vecsort(vector(P/q*lim\eulerphi(P/q), k, eulerphi(k)), , 8); v=select(n->n<=lim, v); forprime(p=2, sqrtint(lim\1+1), P=p; while((P*=p) <= lim+1, listput(u, P-1))); v=vecsort(concat(v, Vec(u)), , 8); u=List([0]); while(#u, v=vecsort(concat(v, Vec(u)),,8); u=List(); for(i=3,#v, for(j=i,#v,P=v[i]*v[j]; if(P>lim,break); if(!vecsearch(v, P), listput(u, P))))); v \\ Charles R Greathouse IV, Jan 08 2013

Extensions

Entry revised by N. J. A. Sloane, Jan 06 2013, Jan 08 2013
Definition clarified by Jianing Song, Dec 24 2021

A342375 Number of commutative rings without 1 containing n elements.

Original entry on oeis.org

0, 1, 1, 5, 1, 3, 1, 24, 5, 3, 1, 14, 1, 3, 3, 125, 1, 14, 1, 14, 3, 3, 1, 58, 5, 3, 25, 14, 1, 7, 1
Offset: 1

Views

Author

Bernard Schott, Mar 09 2021

Keywords

Comments

A ring without 1 is still a ring, but sometimes it is called a rng, or a non-unital ring, or a pseudo-ring (see Wikipedia links).

Examples

			a(1) = 0 because the only ring with 1 element is the zero ring with the element 0, and for this ring, 0 and 1 coincide.
a(2) = 1, and for this corresponding ring with elements {0,a}, the multiplication that is defined by: 0*0 = 0*a = a*0 = a*a = 0 is commutative, also this ring is without unit, hence a(2) = 1; the Matrix ring {0,a} with coefficients from Z/2Z:
          (0 0)           (0 0)
      0 = (0 0)       a = (1 0)  is such an example.
For n=8, there are 52 rings of order 8, 24 of which are commutative rings without 1, so a(8) = 24.
		

Crossrefs

Number of commutative rings: A127707 (with 1 containing n elements), this sequence (without 1 containing n elements), A037289 (with n elements).

Formula

a(n) = A037289(n) - A127707(n).

A342377 Number of rings without 1 containing n elements.

Original entry on oeis.org

0, 1, 1, 7, 1, 3, 1, 41, 7, 3, 1, 18, 1, 3, 3, 340, 1, 18, 1, 18, 3, 3, 1, 93, 7, 3, 47, 18, 1, 7, 1
Offset: 1

Views

Author

Bernard Schott, Mar 12 2021

Keywords

Comments

A ring without 1 is still a ring, although sometimes called a rng, or a non-unital ring, or a pseudo-ring (see Wikipedia links).

Examples

			a(1) = 0 because the only ring with 1 element is the zero ring (see link) with the element 0, and for this ring, 0 and 1 coincide.
a(3) = 1 because the Matrix ring with 3 elements with coefficients from Z/3Z:
         (0 0)       (0 0)        (0 0)
     0 = (0 0),  a = (1 0),   b = (2 0)
  is without 1 (note this ring is commutative) and there is no other such ring with 3 elements and without 1, hence a(3) = 1.
		

Crossrefs

Number of rings: A037291 (with 1 containing n elements), this sequence (without 1 containing n elements), A027623 or A037234 (with n elements).

Formula

a(n) = A037234(n) - A037291(n) = A342375(n) + A342376(n).
a(p) = 1 if p prime.

A186116 Number of nonisomorphic rings with n elements minus number of groups of order n.

Original entry on oeis.org

0, 1, 1, 9, 1, 2, 1, 47, 9, 2, 1, 17, 1, 2, 3, 376, 1, 17, 1, 17, 2, 2, 1, 89, 9, 2, 54, 18, 1, 4, 1
Offset: 1

Views

Author

Jonathan Vos Post, Feb 13 2011

Keywords

Comments

a(p) = 1 for p prime, as there is a unique group of order p (the cyclic group), and 2 nonisomorphic rings with p elements, so 2 - 1 = 1.
a(p^2) = 9 for p prime, as there are 11 mutually nonisomorphic rings of order p^2 [Raghavendran, p. 228] and 2 groups of order p^2, so 11 - 2 = 9.
a(p^3) = 3*p+45 for p an odd prime, as there are 3*p+50 nonisomorphic rings with p^3 elements [R. Ballieu, Math. Rev. 9, 267; see also Math. Rev. 51#5655]; see also Antipkin, and 5 nonisomorphic groups of order p^3.
The first unknown value as of Feb 13, 2011 is a(32). Then a(64) is unknown.
In a sense, this measures the excess in combinatorial structures available by moving from one binary operation to two binary operations, and moving from the group axioms to the ring axioms.

Examples

			a(1) = 0 because there is a unique ring with 1 element, and a unique group of order 1, so 1 - 1 = 0.
		

Crossrefs

Formula

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

A037292 Number of nonassociative rings with n elements.

Original entry on oeis.org

1, 2, 2, 55, 2, 4, 2, 801288, 165, 4, 2, 110, 2, 4, 4
Offset: 1

Views

Author

Christian G. Bower, Jun 15 1998

Keywords

Comments

The standard definition of a ring requires that multiplication be associative, so these are very nonstandard rings.
The rings need not contain a multiplicative unit.
In fact more is known: 1,2,2,55,2,4,2,801288,165,4,2,110,2,4,4,?,2,330,2,110,4,4,2,1602576.
This sequence may be multiplicative. - Mitch Harris, Apr 19 2005

Crossrefs

Cf. A027623.

A305858 a(n) = number of near-rings with n elements.

Original entry on oeis.org

1, 3, 5, 35, 10, 99, 24, 3858, 486, 535, 139, 54694, 454, 4537, 3817
Offset: 1

Views

Author

Keywords

Comments

Near-rings are defined like rings but addition need not be commutative and multiplication need only left-distribute over addition (of course, right-distribution leads to an equivalent theory). Also, there need not exist a multiplicative identity.

Examples

			The only near-ring of order 1 is the trivial ring, so a(1) = 1.
There are 3 near-rings of order 2, all over Z2, so a(2) = 3.
There are 5 near-rings of order 3, all over Z3, so a(3) = 5.
There are 12 near-rings over Z4 and 23 near-rings over Z2^2, so a(4) = 12 + 23 = 35.
There are 10 near-rings of order 5, all over Z5, so a(5) = 10.
There are 60 near-rings over Z6 and 39 near-rings over S3, so a(6) = 60 + 39 = 99.
There are 24 near-rings of order 7, all over Z7, so a(7) = 24.
There are 135 near-rings over Z8, 1447 near-rings over D8, 281 near-rings over Q, 115 over Z4*Z2, and many over Z2^3, so a(8) > 1978.
		

References

  • Gunter Pilz, Near-Rings: The Theory and its Applications, Revised Edition (1983), North-Holland Publishing Company.

Crossrefs

Formula

Since all rings are near-rings, a(n) >= A027623(n).

Extensions

a(8)-a(13) from Choiwah Chow, Dec 18 2022
a(14)-a(15) from Choiwah Chow, Oct 21 2024

A118477 Number of nonassociative rings with <= n elements.

Original entry on oeis.org

1, 3, 5, 60, 62, 66, 68, 801356, 801521, 801525, 801527, 801637, 801639, 801643, 801647
Offset: 1

Views

Author

Jonathan Vos Post, May 05 2006

Keywords

Comments

Partial sums of A037292 Number of nonassociative rings with n elements.

Examples

			a(15) = 1 + 2 + 2 + 55 + 2 + 4 + 2 + 801288 + 165 + 4 + 2 + 110 + 2 + 4 + 4 = 801647.
		

References

  • "Reviews in Ring Theory, 1980-1984", American Mathematical Society, 1986; ISBN 0-8218-0097-3.

Crossrefs

Formula

a(n) = Sum_{i=1..n} A037292(i).

Extensions

Data corrected by Giovanni Resta, Jun 16 2016
Previous Showing 11-20 of 22 results. Next