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.

A054003 tau(n+1) - tau(n) where n and n+1 have the same sum of divisors.

Original entry on oeis.org

0, 2, -4, 0, 4, 0, 0, 8, 6, -4, -6, 6, -8, -8, 0, 4, 0, 4, 0, 8, 8, -8, 0, -4, 0, 8, -8, 0, -12, 12, -8, 8, 0, -8, -8, -4, -12, 24, -8, 0, 8, 0, -8, -4, -8, -8, 0, 16, -4, -4, 4, 0, 0, -28, 0, 0, -20, -4, 24, 0, -16, 8, 8, -8, -8, 12, -16, 0, -40, 40, -8, 8, 0, 0, 0, 40, -8, 0, 40
Offset: 1

Views

Author

Asher Auel, Jan 12 2000

Keywords

Crossrefs

Programs

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

Formula

a(n) = A054002(n) - A053249(n).

Extensions

More terms from Naohiro Nomoto, Jun 23 2001