A101373 -id:A101373 - cp's OEIS frontend

A100827 Highly cototient numbers: records for a(n) in A063741.

2, 4, 8, 23, 35, 47, 59, 63, 83, 89, 113, 119, 167, 209, 269, 299, 329, 389, 419, 509, 629, 659, 779, 839, 1049, 1169, 1259, 1469, 1649, 1679, 1889, 2099, 2309, 2729, 3149, 3359, 3569, 3989, 4199, 4289, 4409, 4619, 5249, 5459, 5879, 6089, 6509, 6719, 6929

Offset: 1

Alonso del Arte, Jan 06 2005

nonn

Each number k on this list has more solutions to the equation x - phi(x) = k (where phi is Euler's totient function, A000010) than any preceding k except 1.
This sequence is a subset of A063741. As noted in that sequence, there are infinitely many solutions to x - phi(x) = 1. Unlike A097942, the highly totient numbers, this sequence has many odd numbers besides 1.
With the expection of 2, 4, 8, all of the known terms are congruent to -1 mod a primorial (A002110). The specific primorial satisfying this congruence would result in a sequence similar to A080404 a(n)=A007947[A055932(n)]. - Wilfredo Lopez (chakotay147138274(AT)yahoo.com), Dec 28 2006
Because most of the solutions to x - phi(x) = k are semiprimes p*q with p+q=k+1, it appears that this sequence eventually has terms that are one less than the Goldbach-related sequence A082917. In fact, terms a(108) to a(176) are A082917(n)-1 for n=106..174. [T. D. Noe, Mar 16 2010] This holds through a(229).  [Jud McCranie, May 18 2017]

			a(3) = 8 since x - phi(x) = 8 has three solutions, {12, 14, 16}, one more than a(2) = 4 which has two solutions, {6, 8}.

Jud McCranie, Table of n, a(n) for n = 1..229 (terms 1..176 by T. D. Noe)
Wikipedia, Highly cototient number

Cf. A063741, A097942, A007374, A101373.

searchMax = 4000; coPhiAnsYldList = Table[0, {searchMax}]; Do[coPhiAns = m - EulerPhi[m]; If[coPhiAns <= searchMax, coPhiAnsYldList[[coPhiAns]]++ ], {m, 1, searchMax^2}]; highlyCototientList = {2}; currHigh = 2; Do[If[coPhiAnsYldList[[n]] > coPhiAnsYldList[[currHigh]], highlyCototientList = {highlyCototientList, n}; currHigh = n], {n, 2, searchMax}]; Flatten[highlyCototientList]

More terms from Robert G. Wilson v, Jan 08 2005

A362184 Record values in A362183.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 16, 17, 21, 23, 25, 26, 27, 31, 33, 34, 37, 38, 45, 49, 54, 59, 62, 64, 71, 80, 81, 84, 92, 99, 106, 122, 137, 145, 147, 167, 174, 180, 183, 203, 211, 231, 232, 251, 253, 283, 289, 306, 318, 342, 362, 378, 410, 412, 453

Offset: 1

Amiram Eldar, Apr 10 2023

nonn

Amiram Eldar, Table of n, a(n) for n = 1..96

The unitary version of A101373.
Cf. A362181, A362183.
Similar sequences: A131934, A361971.

ucototient[n_] := n - Times @@ (Power @@@ FactorInteger[n] - 1); ucototient[1] = 0; With[{max = 300}, solnum = Table[0, {n, 1, max}]; Do[If[(i = ucototient[k]) <= max, solnum[[i]]++], {k, 2, max^2}]; s = {1}; solmax=1; Do[sol = solnum[[k]]; If[sol > solmax, solmax = sol; AppendTo[s, sol]], {k, 2, max}]; s]

a(n) = A362181(A362183(n)).

A362213 Irregular table read by rows in which the n-th row consists of all the numbers m such that cototient(m) = n, where cototient is A051953.

Original entry on oeis.org

4, 9, 6, 8, 25, 10, 15, 49, 12, 14, 16, 21, 27, 35, 121, 18, 20, 22, 33, 169, 26, 39, 55, 24, 28, 32, 65, 77, 289, 34, 51, 91, 361, 38, 45, 57, 85, 30, 95, 119, 143, 529, 36, 40, 44, 46, 69, 125, 133, 63, 81, 115, 187, 52, 161, 209, 221, 841, 42, 50, 58, 87, 247, 961

Offset: 2

Amiram Eldar, Apr 11 2023

The offset is 2 since cototient(p) = 1 for all primes p.

The 0th row consists of one term, 1, since 1 is the only solution to cototient(x) = 0.

			The table begins:
  n   n-th row
  --  -----------
   2  4;
   3  9;
   4  6, 8;
   5  25;
   6  10;
   7  15, 49;
   8  12, 14, 16;
   9  21, 27;
  10
  11  35, 121;
  12  18, 20, 22;

Amiram Eldar, Table of n, a(n) for n = 2..9674 (rows 2..1000)

Cf. A005278, A051953, A063507, A063740 (row lengths), A063741, A063742, A063748, A100827, A101373, A131825, A131826.

Similar sequences: A032447, A361966, A362180.

With[{max = 50}, cot = Table[n - EulerPhi[n], {n, 1, max^2}]; row[n_] := Position[cot, n] // Flatten; Table[row[n], {n, 2, max}] // Flatten]

A362403 Number of times that the number A362402(n) occurs as a sum of divisors that have a square factor (A162296).

Original entry on oeis.org

0, 1, 2, 3, 5, 7, 9, 10, 13, 15, 16, 20, 22, 23, 28, 34, 46, 53, 60, 62, 78, 81, 113, 115, 122, 132, 154, 184, 185, 222, 248, 254, 343, 346, 350, 354, 497, 569, 701, 711, 860, 941, 1088, 1221, 1222, 1235, 1263, 1306, 1572, 1721, 1737, 1948, 2191, 2315, 2418, 2877

Offset: 1

Amiram Eldar, Apr 18 2023

nonn

Amiram Eldar, Table of n, a(n) for n = 1..60

Cf. A162296, A362401, A362402.

Similar sequences: A131934, A101373, A206027, A238896.

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 = {0}, t, tmax = 0}, t = Sort[Tally[v]]; Do[If[t[[k]][[2]] > tmax, tmax = t[[k]][[2]]; AppendTo[sq, t[[k]][[2]]]], {k, 1, Length[t]}]; sq]; seq[10^5]

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(0, ", "); for(k=1, kmax, if(v[k] > vmax, vmax = v[k]; print1(v[k], ", "))); }

A362488 Record values in A362487.

Original entry on oeis.org

2, 4, 6, 10, 14, 18, 22, 30, 34, 40, 48, 58, 60, 92, 136, 146, 184, 232, 240, 342, 478, 518, 638, 772, 830, 924, 1080, 1264, 1330, 1340, 1462, 1824, 2132, 2528, 2710, 3224, 3354, 4084, 4672, 4812, 4976, 5912, 6496, 7606, 8230, 8698, 11472, 12354, 16580, 19250

Offset: 1

Amiram Eldar, Apr 22 2023

nonn

Cf. A362484, A362487.

Similar sequences: A101373, A131934, A361971, A362184.

solnum[n_] := Length[invIPhi[n]]; seq[kmax_] := Module[{s = {}, solmax=0}, Do[sol = solnum[k]; If[sol > solmax, solmax = sol; AppendTo[s, sol]], {k, 1, kmax}]; s]; seq[10^4] (* using the function invIPhi from A362484 *)

a(n) = A362485(A362487(n)).

cp's OEIS Frontend

A100827 Highly cototient numbers: records for a(n) in A063741.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

Extensions

A362184 Record values in A362183.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A362213 Irregular table read by rows in which the n-th row consists of all the numbers m such that cototient(m) = n, where cototient is A051953.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A362403 Number of times that the number A362402(n) occurs as a sum of divisors that have a square factor (A162296).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

A362488 Record values in A362487.

Views

Author

Keywords

Crossrefs

Programs

Mathematica

Formula