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.

A357313 a(n) is the unique number m such that A001065(m) = A057709(n).

Original entry on oeis.org

4, 9, 8, 15, 14, 21, 121, 289, 529, 46, 28, 841, 62, 24, 1369, 217, 2209, 106, 68, 3481, 54, 4489, 134, 5041, 66, 6241, 158, 6889, 166, 116, 9409, 10201, 218, 226, 148, 130, 114, 16129, 17161, 18769, 278, 90, 24649, 314, 26569, 27889, 108, 29929, 225, 32041, 244
Offset: 1

Views

Author

Amiram Eldar, Sep 23 2022

Keywords

Examples

			a(1) = 4 since 4 is the unique solution m to A001065(m) = A057709(1) = 3.
		

Crossrefs

Programs

  • Mathematica
    seq[max_] := Module[{s = t = Table[0, {n, 1, max}], i, j}, Do[If[(i = DivisorSigma[1, n] - n) <= max, s[[i]]++; t[[i]] = n], {n, 2, (max - 1)^2}]; j = Position[s, 1] // Flatten; t[[j]]]; seq[250]

Formula

A001065(a(n)) = A057709(n).