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-5 of 5 results.

A366439 The sum of divisors of the exponentially odd numbers (A268335).

Original entry on oeis.org

1, 3, 4, 6, 12, 8, 15, 18, 12, 14, 24, 24, 18, 20, 32, 36, 24, 60, 42, 40, 30, 72, 32, 63, 48, 54, 48, 38, 60, 56, 90, 42, 96, 44, 72, 48, 72, 54, 120, 72, 120, 80, 90, 60, 62, 96, 84, 144, 68, 96, 144, 72, 74, 114, 96, 168, 80, 126, 84, 108, 132, 120, 180, 90
Offset: 1

Views

Author

Amiram Eldar, Oct 10 2023

Keywords

Links

Crossrefs

Cf. A000203, A065463, A268335, A366438.
Similar sequences: A062822, A065764, A180114, A362986, A366440.

Programs

  • Mathematica
    f[p_, e_] := (p^(e+1)-1)/(p-1); s[n_] := Module[{fct = FactorInteger[n]}, If[AllTrue[fct[[;;, 2]], OddQ], Times @@ f @@@ fct, Nothing]]; s[1] = 1; Array[s, 100]
  • PARI
    lista(max) = for(k = 1, max, my(f = factor(k), isexpodd = 1); for(i = 1, #f~, if(!(f[i, 2] % 2), isexpodd = 0; break)); if(isexpodd, print1(sigma(f), ", ")));
  • Python
    from math import prod
from itertools import count, islice
from sympy import factorint
def A366439_gen(): # generator of terms
    for n in count(1):
        f = factorint(n)
        if all(e&1 for e in f.values()):
            yield prod((p**(e+1)-1)//(p-1) for p,e in f.items())
A366439_list = list(islice(A366439_gen(),30)) # Chai Wah Wu, Oct 11 2023

Formula

a(n) = A000203(A268335(n)).
Sum_{k=1..n} a(k) ~ c * n^2, where c = (1/(2*d^2)) * Product_{p prime} (1 + 1/(p^5-p)) = 1.045911669131479732932..., where d = 0.7044422... (A065463) is the asymptotic density of the exponentially odd numbers.
The asymptotic mean of the abundancy index of the exponentially odd numbers: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k)/A268335(k) = (1/d) * Product_{p prime} (1 + 1/(p^5-p)) = 2 * c * d = 1.4735686365073812503199... .

A366440 The sum of divisors of the cubefree numbers (A004709).

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 8, 13, 18, 12, 28, 14, 24, 24, 18, 39, 20, 42, 32, 36, 24, 31, 42, 56, 30, 72, 32, 48, 54, 48, 91, 38, 60, 56, 42, 96, 44, 84, 78, 72, 48, 57, 93, 72, 98, 54, 72, 80, 90, 60, 168, 62, 96, 104, 84, 144, 68, 126, 96, 144, 72, 74, 114, 124, 140
Offset: 1

Views

Author

Amiram Eldar, Oct 10 2023

Keywords

Links

Crossrefs

Cf. A000203, A004709, A358040.
Cf. A002117, A082020.
Similar sequences: A062822, A065764, A180114, A362986, A366439.

Programs

  • Mathematica
    f[p_, e_] := (p^(e+1)-1)/(p-1); s[n_] := Module[{fct = FactorInteger[n]}, If[AllTrue[fct[[;;, 2]], # < 3 &], Times @@ f @@@ fct, Nothing]]; s[1] = 1; Array[s, 100]
  • PARI
    lista(max) = for(k = 1, max, my(f = factor(k), iscubefree = 1); for(i = 1, #f~, if(f[i, 2] > 2, iscubefree = 0; break)); if(iscubefree, print1(sigma(f), ", ")));
  • Python
    from sympy import mobius, integer_nthroot, divisor_sigma
def A366440(n):
    def f(x): return n+x-sum(mobius(k)*(x//k**3) for k in range(1, integer_nthroot(x,3)[0]+1))
    m, k = n, f(n)
    while m != k:
        m, k = k, f(k)
    return divisor_sigma(m) # Chai Wah Wu, Aug 06 2024

Formula

a(n) = A000203(A004709(n)).
Sum_{k=1..n} a(k) ~ c * n^2, where c = 15*zeta(3)/(2*Pi^2) = A082020 * A002117 / 2 = 0.913453711751... .
The asymptotic mean of the abundancy index of the cubefree numbers: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k)/A004709(k) = 15/Pi^2 = 1.519817... (A082020).

A363195 Number of divisors of the n-th cubefull number A036966(n).

Original entry on oeis.org

1, 4, 5, 4, 6, 7, 5, 4, 8, 16, 6, 9, 4, 20, 10, 5, 20, 7, 24, 16, 11, 25, 4, 28, 24, 20, 12, 8, 4, 5, 30, 16, 6, 16, 32, 30, 24, 13, 4, 20, 35, 20, 28, 9, 4, 36, 36, 28, 14, 16, 25, 20, 40, 16, 24, 35, 4, 40, 5, 42, 7, 32, 15, 6, 20, 32, 16, 20, 10, 30, 45, 20
Offset: 1

Views

Author

Amiram Eldar, May 21 2023

Keywords

Links

Crossrefs

Cf. A000005, A036966, A362986.
Similar sequences: A072048, A076400, A363194.

Programs

  • Mathematica
    DivisorSigma[0, Select[Range[25000], # == 1 || Min[FactorInteger[#][[;; , 2]]] > 2 &]]
  • PARI
    lista(kmax) = for(k = 1, kmax, if(k==1 || vecmin(factor(k)[, 2]) > 2, print1(numdiv(k), ", ")));
  • Python
    from itertools import count, islice
from math import prod
from sympy import factorint
def A363195_gen(): # generator of terms
    for n in count(1):
        f = factorint(n).values()
        if all(e>2 for e in f):
            yield prod(e+1 for e in f)
A363195_list = list(islice(A363195_gen(),20)) # Chai Wah Wu, May 21 2023

Formula

a(n) = A000005(A036966(n)).
Sum_{A036966(k) < x} a(k) = c_1 * x^(1/3) * log(x)^3 + c_2 * x^(1/3) * log(x)^2 + c_3 * x^(1/3) * log(x) + c_4 * x^(1/3) + O(x^(7/24 + eps)), where c_1, c_2, c_3 and c_4 are constants. c_1 = Product_{p prime} ((1-1/p)^4 * (1 + 1/((p^(1/3) - 1)^2*p^(1/3)) + 3/(p-p^(2/3))))/162 = 0.1346652397135839416... . [corrected Sep 21 2024]

A362985 Decimal expansion of the asymptotic mean of the abundancy index of the cubefull numbers (A036966).

Original entry on oeis.org

2, 4, 8, 2, 1, 7, 9, 1, 9, 6, 4, 2, 2, 3, 5, 9, 5, 2, 5, 4, 6, 1, 6, 7, 6, 4, 3, 6, 7, 4, 6, 8, 7, 6, 9, 8, 5, 3, 6, 3, 6, 8, 9, 4, 0, 9, 7, 1, 9, 3, 0, 4, 6, 8, 3, 5, 4, 3, 6, 3, 9, 3, 2, 8, 1, 4, 4, 4, 2, 3, 3, 8, 8, 5, 7, 6, 7, 5, 0, 4, 6, 3, 4, 1, 1, 5, 0, 7, 3, 1, 0, 3, 9, 8, 0, 4, 4, 7, 4, 0, 3, 7, 3, 1, 0
Offset: 1

Views

Author

Amiram Eldar, May 12 2023

Keywords

Examples

			2.48217919642235952546167643674687698536368940971930468354...

Links

Crossrefs

Cf. A000203, A036966, A017665, A017666, A362986.
Similar constants (the asymptotic mean of the abundancy index of other sequences): A013661 (all positive integers), A082020 (cubefree), A111003 (odd), A157292 (5-free), A157294 (7-free), A157296 (9-free), A245058 (even), A240976 (squares), A306633 (squarefree), A362984 (powerful).

Programs

  • Mathematica
    $MaxExtraPrecision = 1000; m = 1000; c = LinearRecurrence[{2, -1, -2, 3, -2, -1, 3, -2, -2, 3, -1, -2, 3, -1, -1, 1}, {0, 0, 0, -4, 0, 6, 7, 4, 9, 0, -11, -22, -26, -21, -15, 20}, m]; RealDigits[((2^5 + 2^(10/3) + 2^3 + 2^(8/3) - 1)/(2^(10/3)*(2^(5/3) + 2^(1/3) + 1)))*((3^5 + 3^(10/3) + 3^3 + 3^(8/3) - 1)/(3^(10/3)*(3^(5/3) + 3^(1/3) + 1))) * Zeta[4/3] * Exp[NSum[Indexed[c, n]*(PrimeZetaP[n/3] - 1/2^(n/3) - 1/3^(n/3))/n, {n, 4, m}, NSumTerms -> m, WorkingPrecision -> m]], 10, 120][[1]]
  • PARI
    zeta(4/3) * prodeulerrat((p^15 + p^10 + p^9 + p^8 - 1)/(p^10 * (p^5 + p + 1)), 1/3)

Formula

Equals lim_{m->oo} (1/m) * Sum_{k=1..m} A362986(k)/A036966(k).
Equals zeta(4/3) * Product_{p prime} ((p^5 + p^(10/3) + p^3 + p^(8/3) - 1)/(p^(10/3) * (p^(5/3) + p^(1/3) + 1))).

A366442 The sum of divisors of the 5-rough numbers (A007310).

Original entry on oeis.org

1, 6, 8, 12, 14, 18, 20, 24, 31, 30, 32, 48, 38, 42, 44, 48, 57, 54, 72, 60, 62, 84, 68, 72, 74, 96, 80, 84, 108, 90, 112, 120, 98, 102, 104, 108, 110, 114, 144, 144, 133, 156, 128, 132, 160, 138, 140, 168, 180, 150, 152, 192, 158, 192, 164, 168, 183, 174, 248
Offset: 1

Views

Author

Amiram Eldar, Oct 10 2023

Keywords

Links

Crossrefs

Cf. A000203, A013661, A007310, A100044, A366441.
Similar sequences: A008438, A062822, A065764, A180114, A362986, A366439, A366440.

Programs

  • Mathematica
    a[n_] := DivisorSigma[1, 2*Floor[3*n/2] - 1]; Array[a, 100]
  • PARI
    a(n) = sigma((3*n)\2 << 1 - 1)
  • Python
    from sympy import divisor_sigma
def A366442(n): return divisor_sigma((n+(n>>1)<<1)-1) # Chai Wah Wu, Oct 10 2023

Formula

a(n) = A000203(A007310(n)).
Sum_{k=1..n} a(k) ~ c * n^2, where c = zeta(2) = 1.644934... (A013661).
The asymptotic mean of the abundancy index of the 5-rough numbers: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k)/A007310(k) = Pi^2/9 = 1.0966227... (A100044).
In general, the asymptotic mean of the abundancy index of the prime(k)-rough numbers is zeta(2) * Product_{i=1..k-1} (1 - 1/prime(i)^2).
Showing 1-5 of 5 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.