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.

A379725 a(n) = A023900(n*A000396(n)).

Original entry on oeis.org

2, 6, -60, 126, -32760, -262140, -3145716, 2147483646, -4611686018427387900, -2475880078570760549798248440, -1622592768292133633915780102881260, -340282366920938463463374607431768211452
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

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

Formula

Conjecture: a(n) = (-1)^(n+1)*A023900(n)*A023900(A000396(n)).