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.

A127707 Number of commutative rings with 1 containing n elements.

Original entry on oeis.org

1, 1, 1, 4, 1, 1, 1, 10, 4, 1, 1, 4, 1, 1, 1, 37, 1, 4, 1, 4, 1, 1, 1, 10, 4, 1, 11, 4, 1, 1, 1, 109, 1, 1, 1, 16, 1, 1, 1, 10, 1, 1, 1, 4, 4, 1, 1, 37, 4, 4, 1, 4, 1, 11, 1, 10, 1, 1, 1, 4, 1, 1, 4
Offset: 1

Views

Author

Hugues Randriam (randriam(AT)enst.fr), Jan 24 2007

Keywords

Comments

Is this a multiplicative function?
Answer: yes! See the Eric M. Rains link for a proof for the result for all unital rings; restricting to commutative rings does not affect the essence of the proof. - Jianing Song, Feb 02 2020

Crossrefs

Formula

a(n) = A037291(n) - A127708(n). - Bernard Schott, Apr 19 2022

Extensions

Keyword 'mult' added by Jianing Song, Feb 02 2020
a(32)-a(63) using Nöbauer's data added by Andrey Zabolotskiy, Apr 18 2022
a(32) = 109 corrected by Bernard Schott, Apr 19 2022