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.

A317474 The number of solutions to sigma(x) = sigma(x+1) below 10^n, where sigma(x) is the sum of divisors function (A000203).

Original entry on oeis.org

0, 1, 3, 9, 24, 62, 113, 232, 533, 1097, 2295, 4804, 10135
Offset: 1

Views

Author

Amiram Eldar, Jul 29 2018

Keywords

Comments

Data extracted from A002961.
The terms were calculated by:
a(1)-a(4) - Andrzej Makowski (1960);
a(5) - Mientka & Vogt (1970), Lal, Eldridge & Gillard (1972);
a(6)-a(7) - Hunsucker, Nebb & Stearns (1973);
a(8) - Pentti Haukkanen (1993);
a(9) - Jud McCranie (1997);
a(10) - T. D. Noe (2007);
a(11)-a(12) - T. D. Noe (2010);
a(13) - Giovanni Resta (2014).
It is not known whether there exist infinitely many natural numbers x for which sigma(x) = sigma(x+1) (see Sierpiński, p. 177). - Stefano Spezia, Jul 13 2025

Examples

			Below 10^3 there are 3 solutions x = 14, 206, 957, hence a(3) = 3.
		

References

  • Wacław Sierpiński, Elementary Theory of Numbers, Warszawa, 1988.

Crossrefs

Programs

Formula

Conjecture: Limit_{n->oo} a(n)/A300285(n) = 1.