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 51-57 of 57 results.

A342092 Odd numbers k such that if k = A001065(m) for some m then m is a squarefree semiprime (A006881).

Original entry on oeis.org

5, 9, 11, 17, 19, 23, 25, 27, 29, 35, 37, 39, 45, 47, 51, 53, 59, 61, 67, 69, 71, 75, 77, 79, 83, 85, 91, 93, 95, 99, 101, 103, 107, 111, 113, 115, 119, 125, 135, 139, 143, 147, 149, 151, 155, 159, 163, 165, 167, 171, 173, 179, 181, 187, 189, 197, 199, 207, 213
Offset: 1

Views

Author

Amiram Eldar, Feb 27 2021

Keywords

Comments

Assuming that every even number above 6 is the sum of 2 distinct prime numbers, p + q (a slightly stronger version of the Goldbach conjecture), then every odd number m above 7 is of the form 1 + p + q, so A001065(p*q) = m. If this is true, then 5 is the only odd untouchable number (A005114).
Alanen (1972) suggested the study of odd numbers that are being "touched" only by Goldbach solutions, i.e., odd numbers k such that there is no solution m to A001065(m) = k which is not a squarefree semiprime. He suggested that perhaps these numbers deserved to be called "almost untouchable" numbers.

Examples

			9 is a term since the only solution to A001065(m) = 9 is m = 3 * 5 = 15.
13 is not a term since there are 2 solutions to A001065(m) = 9, m = 27 = 3^3 and m = 35 = 5*7, and the first solution is not a semiprime.
		

Crossrefs

Programs

  • Mathematica
    seq[max_] := Module[{v = Table[0, {max}]}, Do[If[! (PrimeOmega[n] == PrimeNu[n] == 2), k = DivisorSigma[1, n] - n; If[OddQ[k] && 2 <= k <= max, v[[k]]++]], {n, 1, max^2}]; Select[Rest[Position[v, _?(# == 0 &)] // Flatten], OddQ]]; seq[300]

A357326 Weird untouchable numbers.

Original entry on oeis.org

836, 7192, 7912, 12670, 13510, 16030, 16310, 16870, 17272, 18830, 21910, 24290, 24430, 26530, 26810, 29470, 31430, 34930, 35210, 35630, 37870, 42910, 43330, 46130, 46270, 48370, 52990, 53830, 57890, 61810, 70910, 73430, 74270, 74410, 76790, 77630, 79030, 82670
Offset: 1

Views

Author

Amiram Eldar, Sep 24 2022

Keywords

Comments

Abundant numbers that are not the sum of any subset of their aliquot divisors, and are also not the sum of all the aliquot divisors of any other number.

Crossrefs

Intersection of A005114 and A006037.

Programs

  • Mathematica
    weirdQ[n_] := Module[{d = Most[Divisors[n]]}, If[Total[d] <= n, False, SeriesCoefficient[Series[Product[1 + x^d[[i]], {i, Length[d]}], {x, 0, n}], n] == 0]]; seq[max_] := Module[{s = Table[0, {n, 1, max}], i}, Do[If[(i = DivisorSigma[1, n] - n) <= max, s[[i]]++], {n, 2, (max - 1)^2}]; Select[Position[s, 0] // Flatten, weirdQ]]; seq[8000]

A363461 Least n-untouchable number.

Original entry on oeis.org

2, 208, 388, 298, 838
Offset: 1

Views

Author

Jinyuan Wang, Jun 03 2023

Keywords

Comments

Let s^m(k) denote the m-th iterate of s(k) = sigma(k) - k. n-untouchable numbers are the numbers that lie in the image of s^(n-1)(k), but not in the image of s^n(k).

Crossrefs

A348160 Odd numbers not appearing in A348158.

Original entry on oeis.org

189, 273, 315, 513, 567, 585, 825, 945, 1071, 1323, 1365, 1539, 1575, 1701, 1755, 1911, 2079, 2205, 2255, 2457, 2565, 2835, 3003, 3069, 3075, 3213, 3465, 3549, 3591, 3969, 4125, 4329, 4347, 4617, 4641, 4725, 4995, 5103, 5187, 5265, 5425, 5481, 5733, 5775, 5859, 5985
Offset: 1

Views

Author

Amiram Eldar, Oct 03 2021

Keywords

Comments

a(19) = 2255 is the least term that is not divisible by 3.

Crossrefs

Cf. A348158.
Similar sequences: A005114, A005277.

Programs

  • Mathematica
    f[n_] := Plus @@ DeleteDuplicates @ Map[EulerPhi, Divisors[n]]; m = 6000; Complement[Range[1, m, 2], Array[f, m^2]]

A363875 Numbers k such that there is no odd number whose aliquot sequence contains k.

Original entry on oeis.org

2, 28, 52, 88, 96, 120, 124, 146, 162, 188, 206, 208, 210, 216, 238, 246, 248, 250, 262, 268, 276, 288, 290, 292, 298, 304, 306, 322, 324, 326, 336, 342, 362, 372, 388, 396, 406, 408, 412, 426, 428, 430, 438, 448, 452, 472, 474, 478, 486, 494, 498, 508, 516
Offset: 1

Views

Author

Jinyuan Wang, Jun 25 2023

Keywords

Comments

k is in sequence iff k can never be reached when iterating the map x -> A001065(x) starting with any odd number m.
Assuming the stronger version of Goldbach conjecture, iff k is in the sequence, there are infinitely many odd numbers whose aliquot sequence contain k.
Supersequence of A005114 (except 5), A283152, A284147, A284156, A284187, ..., and untouchable perfect numbers (28, 137438691328, ...), untouchable amicable numbers (A238382), untouchable sociable numbers.

Crossrefs

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};
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]

A378088 Repdigit untouchable numbers.

Original entry on oeis.org

2, 5, 88, 66666, 222222, 6666666
Offset: 1

Views

Author

Shyam Sunder Gupta, Nov 16 2024

Keywords

Examples

			222222 is a sequence member because it is an untouchable number whose digits are all equal.
		

Crossrefs

Intersection of A005114 and A010785.
Previous Showing 51-57 of 57 results.