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

A379724 a(n) = A000668(n) - 1.

Original entry on oeis.org

2, 6, 30, 126, 8190, 131070, 524286, 2147483646, 2305843009213693950, 618970019642690137449562110, 162259276829213363391578010288126, 170141183460469231731687303715884105726
Offset: 1

Views

Author

Mats Granvik and Antti Karttunen, Dec 31 2024

Keywords

Crossrefs

Cf. A000396, A000668, A023900, A072868, A379725.

Programs

  • Mathematica
    nn = 12; A023900[n_] := DivisorSum[n, MoebiusMu[#] # &]; Table[A023900[PerfectNumber[n]], {n, 1, nn}]

Formula

a(n) = A023900(A000396(n)), provided no odd perfect numbers exist.
Conjecture; a(n) = A072868(n) - 2. - Omar E. Pol, Jan 16 2025
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.