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

A364991 Primitive coreful 3-abundant numbers: coreful 3-abundant numbers (A340109) that are powerful numbers (A001694).

Original entry on oeis.org

5400, 7200, 10800, 14400, 16200, 18000, 21168, 21600, 27000, 28800, 32400, 36000, 42336, 43200, 48600, 54000, 56448, 57600, 63504, 64800, 72000, 81000, 84672, 86400, 88200, 90000, 97200, 98784, 104544, 108000, 112896, 115200, 127008, 129600, 135000, 144000, 145800
Offset: 1

Views

Author

Amiram Eldar, Aug 15 2023

Keywords

Comments

Powerful numbers k such that csigma(k) > 3*k, where csigma(k) = A057723(k) is the sum of the coreful divisors of k.
If m is a term and k is a squarefree number coprime to m, then csigma(k*m) = csigma(k) * csigma(m) = k * csigma(m) > 3*k*m, so k*m is a coreful 3-abundant number. Therefore, the sequence of coreful 3-abundant numbers (A340109) can be generated from this sequence by multiplying with coprime squarefree numbers. The asymptotic density of the coreful 3-abundant numbers can be calculated from this sequence (see comment in A340109).

Crossrefs

Intersection of A001694 and A340109.
Subsequence of A356871.

Programs

  • Mathematica
    f[p_, e_] := (p^(e+1)-1)/(p-1)-1; g[1] = 1; g[n_] := If[AllTrue[(fct = FactorInteger[n])[[;; , 2]], #>1 &], Times @@ f @@@ fct, 0]; seq[kmax_] := Module[{s = {}}, Do[If[g[k] > 3*k, AppendTo[s, k]], {k, 1, kmax}]; s]; seq[500000]
  • PARI
    s(f) = prod(i = 1, #f~, sigma(f[i, 1]^f[i, 2]) - 1);
    lista(kmax) = {my(f); for(k=2, kmax, f=factor(k); if(vecmin(f[,2]) > 1 && s(f) > 3*k, print1(k, ", ")));}

A323332 The Dedekind psi function values of the powerful numbers, A001615(A001694(n)).

Original entry on oeis.org

1, 6, 12, 12, 24, 30, 36, 48, 72, 56, 96, 144, 108, 180, 216, 132, 150, 192, 288, 182, 336, 360, 432, 360, 324, 384, 576, 306, 648, 392, 380, 672, 720, 864, 672, 792, 900, 768, 552, 1152, 750, 1296, 1080, 1092, 972, 1344, 1440, 870, 1728, 2160, 992, 1584
Offset: 1

Views

Author

Amiram Eldar, Jan 11 2019

Keywords

Comments

The sum of the reciprocals of all the terms of this sequence is Pi^2/6 (A013661).
The asymptotic density of a sequence S that possesses the property that an integer k is a term if and only if its powerful part, A057521(k) is a term, is (1/zeta(2)) * Sum_{n>=1, A001694(n) is a term of S} 1/a(n). Examples for such sequences are the e-perfect numbers (A054979), the exponential abundant numbers (A129575), and other sequences listed in the Crossrefs section. - Amiram Eldar, May 06 2025

Crossrefs

Sequences whose density can be calculated using this sequence: A054979, A129575, A307958, A308053, A321147, A322858, A323310, A328135, A339936, A340109, A364990, A382061, A383693, A383695, A383697.

Programs

  • Mathematica
    psi[1]=1; psi[n_] := n * Times@@(1+1/Transpose[FactorInteger[n]][[1]]); psi /@ Join[{1}, Select[Range@ 1200, Min@ FactorInteger[#][[All, 2]] > 1 &]] (* after T. D. Noe at A001615 and Harvey P. Dale at A001694 *)
  • Python
    from math import isqrt, prod
    from sympy import mobius, integer_nthroot, primefactors
    def A323332(n):
        def squarefreepi(n): return int(sum(mobius(k)*(n//k**2) for k in range(1, isqrt(n)+1)))
        def bisection(f,kmin=0,kmax=1):
            while f(kmax) > kmax: kmax <<= 1
            while kmax-kmin > 1:
                kmid = kmax+kmin>>1
                if f(kmid) <= kmid:
                    kmax = kmid
                else:
                    kmin = kmid
            return kmax
        def f(x):
            c, l = n+x-squarefreepi(integer_nthroot(x,3)[0]), 0
            j = isqrt(x)
            while j>1:
                k2 = integer_nthroot(x//j**2,3)[0]+1
                w = squarefreepi(k2-1)
                c -= j*(w-l)
                l, j = w, isqrt(x//k2**3)
            return c+l
        a = primefactors(m:=bisection(f,n,n))
        return m*prod(p+1 for p in a)//prod(a) # Chai Wah Wu, Sep 14 2024

A380930 Numbers k such that A380845(k) > 3*k.

Original entry on oeis.org

1080, 2160, 3600, 4320, 7200, 7440, 8640, 11340, 13608, 14400, 14880, 15120, 17280, 18600, 22680, 22860, 27216, 28800, 29760, 30240, 30480, 31752, 33264, 34020, 34560, 37200, 41664, 45360, 45720, 45900, 51408, 53340, 54432, 57600, 59520, 60480, 60960, 61200, 63504
Offset: 1

Views

Author

Amiram Eldar, Feb 08 2025

Keywords

Comments

Analogous to 3-abundant numbers (A068403) with A380845 instead of A000203.

Crossrefs

Subsequence of A068403 and A380929.
Subsequences: A380848, A380931.
Similar sequences: A285615, A293187, A300664, A328135, A340109.

Programs

  • Mathematica
    q[k_] := Module[{h = DigitCount[k, 2, 1]}, DivisorSum[k, # &, DigitCount[#, 2, 1] == h &] > 3*k]; Select[Range[64000], q]
  • PARI
    isok(k) = {my(h = hammingweight(k)); sumdiv(k, d, d*(hammingweight(d) == h)) > 3*k;}

Formula

1080 is a term since A380845(1080) = 3330 > 3 * 1080 = 3240.

A340110 Coreful 4-abundant numbers: numbers k such that csigma(k) > 4*k, where csigma(k) is the sum of the coreful divisors of k (A057723).

Original entry on oeis.org

10584000, 12700800, 15876000, 19051200, 21168000, 22226400, 25401600, 29635200, 31752000, 37044000, 38102400, 42336000, 44452800, 47628000, 50803200, 52920000, 55566000, 57153600, 59270400, 63504000, 64033200, 66679200, 74088000, 76204800, 79380000, 84672000
Offset: 1

Views

Author

Amiram Eldar, Dec 28 2020

Keywords

Comments

A coreful divisor d of a number k is a divisor with the same set of distinct prime factors as k, or rad(d) = rad(k), where rad(k) is the largest squarefree divisor of k (A007947).
Analogous to A068404 as A308053 is analogous to A005101.

Examples

			10584000 is a term since csigma(10584000) = 42653520 > 4 * 10584000.
		

Crossrefs

Subsequence of A308053 and A340109.
Similar sequences: A068404, A307114.

Programs

  • Mathematica
    f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - 1; s[1] = 1; s[n_] := Times @@ (f @@@ FactorInteger[n]); Select[Range[10^8], s[#] > 4*# &]
Showing 1-4 of 4 results.