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-2 of 2 results.

A080847 a(n) = mu(n)+2, where mu is the Moebius function (A008683).

Original entry on oeis.org

3, 1, 1, 2, 1, 3, 1, 2, 2, 3, 1, 2, 1, 3, 3, 2, 1, 2, 1, 2, 3, 3, 1, 2, 2, 3, 2, 2, 1, 1, 1, 2, 3, 3, 3, 2, 1, 3, 3, 2, 1, 1, 1, 2, 2, 3, 1, 2, 2, 2, 3, 2, 1, 2, 3, 2, 3, 3, 1, 2, 1, 3, 2, 2, 3, 1, 1, 2, 3, 1, 1, 2, 1, 3, 2, 2, 3, 1, 1, 2, 2, 3, 1, 2, 3, 3, 3, 2, 1, 2, 3, 2, 3, 3, 3, 2, 1, 2, 2, 2, 1, 1, 1, 2, 1
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2003

Keywords

Crossrefs

Cf. A008683, one more than A007423, one less than A231821.

Programs

Formula

1 <= a(n) <= 3.

A080849 a(n) = (mu(n)+2)*n^2, where mu is the Moebius function (A008683).

Original entry on oeis.org

3, 4, 9, 32, 25, 108, 49, 128, 162, 300, 121, 288, 169, 588, 675, 512, 289, 648, 361, 800, 1323, 1452, 529, 1152, 1250, 2028, 1458, 1568, 841, 900, 961, 2048, 3267, 3468, 3675, 2592, 1369, 4332, 4563, 3200, 1681, 1764, 1849, 3872, 4050, 6348, 2209, 4608, 4802
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 20 2003

Keywords

Crossrefs

Programs

Formula

n^2 <= a(n) <= 3*n^2.
a(n) = n * A080848(n) = A000290(n) * A080847(n). - Antti Karttunen, Jul 26 2017
Sum_{n>=1} 1/a(n) = (Pi^4 + 6)/(12*Pi^2). - Amiram Eldar, May 17 2025
Showing 1-2 of 2 results.