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.

Showing 1-3 of 3 results.

A336253 Exponential barely deficient numbers: exponential deficient numbers whose exponential abundancy is closer to 2 than that of any smaller exponential deficient number.

Original entry on oeis.org

1, 4, 72, 100, 144, 3528, 12100, 15876, 24336, 441000, 1334025, 2205000, 5664400, 24206400, 71267364, 151880976, 3252372552, 9346201200, 13319078472, 26828235000, 347372082000, 1851803856100, 2260121356900, 3198696480100, 5202286387272, 10330374528100, 16316106062400
Offset: 1

Views

Author

Amiram Eldar, Jul 14 2020

Keywords

Comments

The exponential abundancy of a number k is esigma(k)/k, where esigma is the sum of exponential divisors of k (A051377).
Exponential deficient numbers are numbers k with esigma(k)/k < 2. These are numbers that are neither e-perfect (A054979) nor exponential abundant (A129575).
The corresponding values of the exponential abundancy are 1, 1.5, 1.666..., 1.8..., 1.833..., ...
All the terms are powerful numbers (A001694) because esigma(k)/k depends only on the powerful part of k (A057521). - Amiram Eldar, May 06 2025

Examples

			4 is a term since it is exponential deficient, and esigma(4)/4 = 3/2 is higher than esigma(k)/k for all the exponential deficient numbers k < 4.

Links

Crossrefs

Cf. A051377, A054979, A057521, A129575.
Subsequence of A001694.
Similar sequences: A302572, A228450, A262228, A307122, A336252, A336254.

Programs

  • Mathematica
    fun[p_, e_] := DivisorSum[e, p^# &]; esigma[1] = 1; esigma[n_] := Times @@ fun @@@ FactorInteger[n]; rm = 0; s={}; Do[r = esigma[n]/n; If[r >= 2, Continue[]]; If[r > rm, rm = r; AppendTo[s, n]], {n, 1, 10^6}]; s

Extensions

a(21)-a(27) from Amiram Eldar, May 06 2025

A336252 Infinitary barely deficient numbers: infinitary deficient numbers whose infinitary abundancy is closer to 2 than that of any smaller infinitary deficient number.

Original entry on oeis.org

1, 2, 8, 84, 110, 128, 1155, 3680, 6490, 8200, 8648, 12008, 18632, 32768, 724000, 1495688, 2095208, 3214090, 3477608, 3660008, 5076008, 12026888, 16102808, 26347688, 29322008, 33653888, 73995392, 615206030, 815634435, 2147483648, 42783299288, 80999455688
Offset: 1

Views

Author

Amiram Eldar, Jul 14 2020

Keywords

Comments

The infinitary abundancy of a number k is isigma(k)/k, where isigma is the sum of infinitary divisors of k (A049417).
The corresponding values of the infinitary abundancy are 1, 1.5, 1.875, 1.904..., 1.963..., ...

Examples

			8 is a term since it is infinitary deficient (A129657), and isigma(8)/8 = 15/8 is higher than isigma(k)/k for all the infinitary deficient numbers k < 8.

Crossrefs

Cf. A049417, A129657, A335054.
Similar sequences: A228450, A262228, A302572, A307122, A336253.

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 = 0; Do[s = isigma[n]/n; If[s < 2 && s > r, AppendTo[seq, n]; r = s], {n, 1, 10^6}]; seq

A336672 Unitary barely 3-deficient numbers: numbers m such that usigma(k)/k < usigma(m)/m < 3 for all numbers k < m, where usigma is the sum of unitary divisors function (A034448).

Original entry on oeis.org

1, 2, 6, 30, 210, 2310, 110670, 182910, 898590, 22851570, 26266170, 45255210, 64124970, 265402410, 1374105810, 1631268870
Offset: 1

Views

Author

Amiram Eldar, Jul 29 2020

Keywords

Comments

Unitary 3-deficient numbers are numbers k such that usigma(k) < 3*k, i.e., numbers that are not in A285615.
The corresponding values of usigma(m)/m are 1, 1.5, 2, 2.4, 2.742..., 2.992..., ...
Are terms squarefree? At some point, do we know that a(n) is divisible by primorial(k) for all n > N(k) for some N(k)? - David A. Corneth, Jul 29 2020
Not all the terms are squarefree. E.g., a(12) = 45255210 is divisible by 11^2.

Crossrefs

The unitary version of A307122.
Cf. A034448, A129487, A285615, A302572, A336671.

Programs

  • Mathematica
    usigma[1] = 1; usigma[n_] := Times @@ (1 + Power @@@ FactorInteger[n]); s = {}; rm = 0; Do[r = usigma[n]/n; If[r < 3 && r > rm, rm = r; AppendTo[s, n]], {n, 1, 10^5}]; s
Showing 1-3 of 3 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.