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.

A054002 Number of divisors of n such that n and n-1 have the same sum of divisors.

Original entry on oeis.org

4, 6, 4, 8, 16, 8, 8, 12, 12, 8, 4, 10, 8, 4, 8, 12, 8, 16, 16, 16, 16, 8, 16, 12, 16, 16, 8, 8, 4, 16, 8, 24, 16, 4, 16, 8, 4, 32, 8, 16, 16, 16, 8, 8, 8, 8, 16, 32, 8, 8, 16, 16, 16, 12, 16, 16, 12, 8, 48, 32, 8, 24, 24, 16, 16, 16, 8, 16, 24, 64, 8, 16, 16, 16, 16, 64, 24, 32, 60
Offset: 1

Views

Author

Asher Auel, Jan 12 2000

Keywords

Crossrefs

Programs

  • Magma
    [#Divisors(n):n in [2..3500000]| SumOfDivisors(n) eq SumOfDivisors(n-1)]; // Marius A. Burtea, Sep 07 2019

Formula

a(n) = tau(A002961(n) + 1).

Extensions

More terms from Naohiro Nomoto, Jun 23 2001