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.

A348272 Noninfinitary highly abundant numbers: numbers m such that nisigma(m) > nisigma(k) for all k < m, where nisigma(k) is the sum of noninfinitary divisors of n (A348271).

Original entry on oeis.org

1, 4, 9, 12, 16, 28, 36, 48, 80, 100, 112, 144, 180, 240, 300, 324, 336, 396, 400, 432, 468, 528, 576, 684, 720, 900, 1008, 1200, 1296, 1584, 1872, 2160, 2268, 2304, 2448, 2736, 2880, 3312, 3600, 5040, 6300, 6480, 7056, 7920, 9072, 9360, 10800, 11088, 11520, 12240
Offset: 1

Views

Author

Amiram Eldar, Oct 09 2021

Keywords

Comments

The corresponding record values are 0, 2, 3, 8, 14, 16, 41, 56, 84, 87, 112, ...

Examples

			The first 9 values of A348271(k) for k = 1 to 9 are: 0, 0, 0, 2, 0, 0, 0, 0 and 3. The record values, 0, 2 and 3, occur at 1, 4 and 9, the first 3 terms of this sequence.

Links

Crossrefs

Cf. A348271.
The noninfinitary version of A002093.
Similar sequences: A285614, A292983, A327634, A328134, A329883.

Programs

  • Mathematica
    f[p_, e_] := Module[{b = IntegerDigits[e, 2], m}, m = Length[b]; Product[If[b[[j]] > 0, 1 + p^(2^(m - j)), 1], {j, 1, m}]]; isigma[1] = 1; isigma[n_] := Times @@ f @@@ FactorInteger[n]; s[n_] := DivisorSigma[1,n] - isigma[n]; seq={}; sm = -1; Do[s1 = s[n];If[s1 > sm, sm= s1; AppendTo[seq, n]], {n, 1, 10^4}]; seq

A348629 Nonexponential highly abundant numbers: numbers m such that nesigma(m) > nesigma(k) for all k < m, where nesigma(k) is the sum of nonexponential divisors of n (A160135).

Original entry on oeis.org

1, 6, 10, 12, 18, 24, 30, 42, 48, 54, 60, 78, 84, 90, 96, 120, 168, 192, 210, 240, 270, 312, 330, 360, 384, 420, 480, 630, 672, 840, 960, 1056, 1080, 1248, 1320, 1440, 1560, 1680, 1890, 1920, 2280, 2310, 2400, 2520, 2640, 2688, 3000, 3120, 3240, 3360, 4200, 4320
Offset: 1

Views

Author

Amiram Eldar, Oct 26 2021

Keywords

Comments

The corresponding record values are 1, 6, 8, 10, 15, 30, 42, 54, 58, 60, 78, ... (see the link for more values).

Examples

			The first 6 values of nesigma(k), for k = 1 to 6 are 1, 1, 1, 1, 1 and 6. The record values, 1 and 6, occur at 1 and 6, the first 2 terms of this sequence.

Links

Crossrefs

Cf. A160135, A348604.
The nonexponential version of A002093.
Similar sequences: A285614, A292983, A327634, A328134, A329883, A348272.

Programs

  • Mathematica
    esigma[n_] := Times @@ (Sum[First[#]^d, {d, Divisors[Last[#]]}] &) /@ FactorInteger[n]; s[1] = 1; s[n_] := DivisorSigma[1, n] - esigma[n]; seq = {}; sm = -1; Do[s1 = s[n]; If[s1 > sm, sm = s1; AppendTo[seq, n]], {n, 1, 10^4}]; seq

A349112 Powerful highly abundant numbers: numbers m such that psigma(m) > psigma(k) for all k < m, where psigma(k) is the sum of powerful divisors of k (A183097).

Original entry on oeis.org

1, 4, 8, 16, 27, 32, 64, 72, 108, 128, 144, 200, 216, 256, 288, 392, 400, 432, 576, 648, 800, 864, 1152, 1296, 1728, 1944, 2304, 2592, 3456, 3888, 5184, 6912, 7776, 10000, 10368, 11664, 13824, 15552, 20000, 20736, 23328, 27000, 27648, 31104, 34992, 40000, 41472
Offset: 1

Views

Author

Amiram Eldar, Nov 08 2021

Keywords

Comments

The corresponding record values are 1, 5, 13, 29, 37, 61, 125, 130, 185, 253, ...

Examples

			The first 8 terms of A183097 are 1, 1, 1, 5, 1, 1, 1 and 13. The record values, 1, 5 and 13, occur at 1, 4 and 8, the first 3 terms of this sequence.

Links

Crossrefs

A349111 is a subsequence.
Cf. A005934, A183097.
Similar sequences: A285614, A292983, A327634, A328134, A329883, A348272.

Programs

  • Mathematica
    f[p_,e_] := (p^(e+1)-1)/(p-1) - p; s[1] = 1; s[n_] := Times @@ f @@@FactorInteger[n]; seq = {}; sm = 0; Do[s1 = s[n]; If[s1 > sm, sm = s1; AppendTo[seq, n]], {n, 1, 10^5}]; seq

A340111 Coreful highly abundant numbers: numbers m such that csigma(m) > csigma(k) for all k < m, where csigma is the sum of the coreful divisors function (A057723).

Original entry on oeis.org

1, 2, 3, 4, 7, 8, 12, 16, 24, 32, 36, 48, 56, 64, 72, 96, 108, 128, 144, 192, 200, 216, 288, 360, 400, 432, 504, 576, 648, 720, 792, 800, 864, 1008, 1080, 1152, 1296, 1440, 1512, 1584, 1728, 1800, 1944, 2016, 2160, 2304, 2592, 2880, 3024, 3240, 3456, 3600
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 highly abundant numbers (A002093) with the sum of the coreful divisors function (A057723) instead of the sum of divisors function (A000203).

Examples

			The first 10 values of A057723(n) for n=1..10 are: 1, 2, 3, 6, 5, 6, 7, 14, 12, 10. The record values, 1, 2, 3, 6, 7 and 14 occur at 1, 2, 3, 4, 7 and 8, the first 6 terms of this sequence.

Links

Crossrefs

Cf. A007947, A057723, A283052, A308053.
Similar sequences: A002093, A285614, A292983, A327634, A328134, A329883.

Programs

  • Mathematica
    f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - 1; s[1] = 1; s[n_] := Times @@ (f @@@ FactorInteger[n]); seq = {}; sm = 0; Do[s1 = s[n]; If[s1 > sm, sm = s1; AppendTo[seq, n]], {n, 1, 3600}]; seq
Showing 1-4 of 4 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.