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.

A324367 Numbers k such that s(k) = s(k+1) where s(k) is the sum of divisors of k that are larger than sqrt(k) (A238535).

Original entry on oeis.org

45, 62, 15795, 355022, 14257705, 28856174, 2324581982, 103321586193
Offset: 1

Views

Author

Amiram Eldar, Sep 03 2019

Keywords

Comments

a(9) > 2*10^11. - Giovanni Resta, Sep 06 2019

Examples

			45 is in the sequence since A238535(45) = A238535(46) = 69.
		

Crossrefs

Programs

  • Mathematica
    s[n_] := DivisorSum[n, # &, # > Sqrt[n] &]; seq={}; s1 = 0; Do[s2 = s[n]; If[s1 == s2, AppendTo[seq, n - 1]]; s1 = s2, {n, 2, 10000}]; seq

Extensions

a(8) from Giovanni Resta, Sep 06 2019