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.

Previous Showing 11-14 of 14 results.

A362402 Positive numbers m such that a record number of numbers k have m as the sum of divisors of k that have a square factor (A162296).

Original entry on oeis.org

1, 4, 48, 72, 216, 288, 864, 1440, 1728, 2880, 3456, 4320, 5184, 5760, 8640, 12096, 17280, 25920, 34560, 48384, 51840, 69120, 103680, 120960, 155520, 181440, 207360, 241920, 311040, 362880, 483840, 622080, 725760, 967680, 1088640, 1209600, 1451520, 2177280, 2903040
Offset: 1

Views

Author

Amiram Eldar, Apr 18 2023

Keywords

Comments

The value 0 appears in the range of A162296 for all squarefree numbers (A005117) and therefore it is excluded from this sequence.
The corresponding record values are in A362403.
Except for 1, a subsequence of A362401.

Links

Crossrefs

Cf. A162296, A362401, A362403.
Similar sequences: A097942, A100827, A145899, A238895.

Programs

  • Mathematica
    s[n_] := Module[{f = FactorInteger[n], p, e}, p = f[[;; , 1]]; e = f[[;; , 2]]; Times @@ ((p^(e + 1) - 1)/(p - 1)) - Times @@ (p + 1)]; s[1] = 0; seq[max_] := Module[{v = Select[Array[s, max], 0 < # <= max &], sq = {1}, t, tmax = 0}, t = Sort[Tally[v]]; Do[If[t[[k]][[2]] > tmax, tmax = t[[k]][[2]]; AppendTo[sq, t[[k]][[1]]]], {k, 1, Length[t]}]; sq]; seq[10^5]
  • PARI
    s(n) = {my(f = factor(n), p, e); prod(i = 1, #f~, p = f[i, 1]; e = f[i, 2]; ((p^(e + 1) - 1)/(p - 1))) -  prod(i = 1, #f~, f[i, 1] + 1);}
lista(kmax) = {my(v = vector(kmax), vmax = 0, i); for(k=1, kmax, i = s(k); if(i > 0 && i <= kmax, v[i]++)); print1(1, ", "); for(k=1, kmax, if(v[k] > vmax, vmax = v[k]; print1(k, ", "))); }

A247131 Numbers n > 0 such that a record number of composite numbers k have n as the sum of the nontrivial divisors of k.

Original entry on oeis.org

1, 2, 5, 20, 30, 48, 72, 90, 114, 120, 168, 210, 300, 330, 360, 390, 420, 510, 630, 720, 780, 840, 1050, 1260, 1470, 1560, 1680, 1890, 2100, 2310, 2520, 2730, 3150, 3360, 3570, 3990, 4200, 4410, 4620, 5250, 5460, 6090, 6510, 6720, 6930, 7770, 7980, 8190, 9030, 9240, 10710, 10920, 11550, 13020, 13650, 13860, 15540
Offset: 1

Views

Author

Daniel Lignon, Nov 22 2014

Keywords

Comments

A prime number has no nontrivial divisors so their sum is = 0. That's why we take only composite numbers.

Examples

			For 1, there are no numbers.
For 2, there is 1 number: 4.
For 5, there are 2 numbers: 6 and 25.
For 20, there are 3 numbers: 18, 51, 91.

Links

Crossrefs

Cf. A145899 (similar but with all divisors), A238895 (similar but with proper divisors), A048050 (Chowla's function: sum of nontrivial divisors).

Programs

  • Mathematica
    ch[1] = 0; ch[n_] := DivisorSigma[1, n] - n - 1; m = 300; v = Table[0, {m}]; Do[c = ch[k]; If[1 <= c <= m, v[[c]]++], {k, 1, m^2}]; s = {}; vm = -1; Do[If[v[[k]] > vm, vm = v[[k]]; AppendTo[s, k]], {k, 1, m}]; s (* Amiram Eldar, Nov 05 2019 *)

Formula

Obviously a(n) = A238895(n)-1.

A370355 Highly touchable numbers sandwiched between untouchable twin pairs.

Original entry on oeis.org

1681, 5251, 7771, 36961, 39271, 170941, 196351, 360361, 510511, 1009471, 9699691
Offset: 1

Views

Author

Amiram Eldar, Feb 16 2024

Keywords

Comments

Highly touchable numbers k have a record number of solutions x to A001065(x) = k, while untouchable numbers k have no solution to this equation.

Crossrefs

Intersection of A238895 and {A231964(n) + 1};
Cf. A001065, A005114.
Similar sequences: A068507, A113839.

Programs

  • Mathematica
    seq[nmax_] := Module[{v = Table[0, {nmax}], i, s = {}, vmax = -1}, Do[i = DivisorSigma[1, n] - n; If[0 < i <= nmax, v[[i]]++], {n, 1, nmax^2}]; Do[If[v[[n]] > vmax, vmax = v[[n]]; If[v[[n - 1]] == 0 && v[[n + 1]] == 0, AppendTo[s, n]]], {n, 2, nmax - 1}]; s]; seq[8000]

A372741 Coreful highly touchable numbers: numbers m > 0 such that a record number of numbers k have m as the sum of the aliquot coreful divisors (A336563) of k.

Original entry on oeis.org

1, 2, 6, 30, 210, 930, 2310, 2730, 30030, 71610, 84630
Offset: 1

Views

Author

Amiram Eldar, May 12 2024

Keywords

Comments

A coreful divisor d of n is a divisor that is divisible by every prime that divides n (see also A307958).
Indices of records of A372739.
The corresponding record values are 0, 1, 3, 6, 8, 9, 11, 12, 15, 16, 17, ... .
a(12) > 2*10^5.

Examples

			a(1) = 1 since it is the least number that is not the sum of aliquot coreful divisors of any number.
a(2) = 2 since it is the least number that is the sum of aliquot coreful divisors of one number: 2 = A336563(4).
a(3) = 6 since it is the least number that is the sum of aliquot coreful divisors of 3 numbers: 6 = A336563(8) = A336563(12) = A336563(18), and there is no number between 2 and 6 that is the sum of aliquot coreful divisors of exactly 2 numbers.

Crossrefs

Cf. A307958, A336563, A372739, A372740.
Similar sequences: A238895, A325177, A331972, A331974.

Programs

  • Mathematica
    f[p_, e_] := (p^(e + 1) - 1)/(p - 1) - 1; s[1] = 0; s[n_] := Times @@ f @@@ FactorInteger[n] - n; seq[m_] := Module[{v = Table[0, {m}], vm = -1, w = {}, i}, Do[i = s[k]; If[1 <= i <= m, v[[i]]++], {k, 1, m^2}]; Do[If[v[[k]] > vm, vm = v[[k]]; AppendTo[w, k]], {k, 1, m}]; w]; seq[1000]
  • PARI
    s(n) = {my(f = factor(n)); prod(i = 1, #f~, (f[i, 1]^(f[i, 2] + 1) - 1)/(f[i, 1] - 1) - 1) - n;}
lista(nmax) = {my(v = vector(nmax), vmax = -1, i); for(k = 1, nmax^2, i = s(k); if(i > 0 && i <= nmax, v[i]++)); for(k = 1, nmax, if(v[k] > vmax, vmax = v[k]; print1(k, ", ")));}
Previous Showing 11-14 of 14 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.