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.

A335055 Odd infinitary abundant numbers whose infinitary abundancy is closer to 2 than that of any smaller odd infinitary abundant number.

Original entry on oeis.org

945, 29835, 33345, 43065, 46035, 49875, 83265, 354585, 359205, 361515, 366135, 382305, 389235, 400785, 403095, 407715, 414645, 416955, 423885, 430815, 437745, 442365, 77967015, 132335385, 210124665, 719709375, 724239285, 1756753845, 9665740455, 10394173335
Offset: 1

Views

Author

Amiram Eldar, May 21 2020

Keywords

Comments

The infinitary abundancy of a number k is isigma(k)/k, where isigma(k) is the sum of infinitary divisors of k (A049417).

Examples

			The infinitary abundancies of the first terms are 2.031..., 2.027..., 2.015..., 2.006..., 2.001..., ...
		

Crossrefs

Programs

  • Mathematica
    fun[p_, e_] := Module[{b = IntegerDigits[e, 2]}, m = Length[b]; Product[If[b[[j]] > 0, 1 + p^(2^(m - j)), 1], {j, 1, m}]]; isigma[1] = 1; isigma[n_] := Times @@ fun @@@ FactorInteger[n]; seq = {}; r = 3; Do[s = isigma[n]/n; If[s > 2 && s < r, AppendTo[seq, n]; r = s], {n, 1, 10^5, 2}]; seq