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.

Showing 1-3 of 3 results.

A027623 a(0) = 1; for n > 0, a(n) = number of rings with n elements.

Original entry on oeis.org

1, 1, 2, 2, 11, 2, 4, 2, 52, 11, 4, 2, 22, 2, 4, 4, 390, 2, 22, 2, 22, 4, 4, 2, 104, 11, 4, 59, 22, 2, 8, 2
Offset: 0

Views

Author

Keywords

Comments

Here a ring means (R,+,*): (R,+) is an abelian group, * is associative, a*(b+c) = a*b + a*c, (a+b)*c = a*c + b*c. Need not contain "1", * need not be commutative.
The sequence continues a(32) = ? (>18590), a(33) = 4, 4, 4, 121, 2, 4, 4, 104, 2, 8, 2, 22, 22, 4, 2, 780, 11, 22, 4, 22, 2, 118, 4, 104, 4, 4, 2, 44, 2, 4, 22 = a(63), a(64) = ? (> 829826). - Christof Noebauer (christof.noebauer(AT)algebra.uni-linz.ac.at), Sep 29 2000
The paper by Antipkin/Elizarov also gives the number a(p^3) of rings of order p^3. - Hans H. Storrer (storrer(AT)math.unizh.ch), Sep 16 2003
If n is a squared prime, there are 11 mutually nonisomorphic rings of order n [see Raghavendran, p. 228]. - R. J. Mathar, Apr 20 2008

Examples

			The 11 rings of order 4 (from _Christian G. Bower_):
  over C4: 1*1 = 0, 1 or 2;
  over C2 X C2 = <1> X <2>: (1*1,1*2,2*1,2*2) = 0000, 0001, 0002, 0012, 0102, 0112, 1002 or 1223.
		

Crossrefs

From Bernard Schott, Mar 28 2021: (Start)
--------------------------------------------------------------------
| Rings with | with 1 | without 1 | with 1 or |
| n elements | | | without 1 |
--------------------------------------------------------------------
| Commutative | A127707 | A342375 | A037289 |
--------------------------------------------------------------------
| Noncommutative | A127708 | A342376 | A209401 |
--------------------------------------------------------------------
| Commutative or | A037291 | A342377 | this sequence: a(0) = 1 |
| noncommutative | | | A037234 with a(0) = 0 |
--------------------------------------------------------------------
(End)

Programs

  • PARI
    apply( A027623(n, e=0)=if( !e, vecprod([call(self(), f) | f <- factor(n)~]), e<3, [2^(n>0), 11][e], e==3, if(n>2, 3*sqrtnint(n, 3), 2)+50, n>2 || e>4, /*error*/("not yet implemented"), 390), [0..63]) \\ M. F. Hasler, Jan 05 2021

Extensions

More terms from Christian G. Bower, Jun 15 1998
a(16) from Christof Noebauer (christof.noebauer(AT)algebra.uni-linz.ac.at), Sep 29 2000

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

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).
Showing 1-3 of 3 results.