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

A083244 k is in the sequence iff the number of numbers unrelated to k is larger than that of related ones[=divisors and coprimes] to k: A045763(k) > A073757(k) or A045763(k) > k/2 or A073757(k) < k/2.

Original entry on oeis.org

42, 54, 60, 66, 70, 72, 78, 84, 90, 96, 98, 100, 102, 108, 110, 114, 120, 126, 130, 132, 138, 140, 144, 150, 154, 156, 160, 162, 168, 170, 174, 180, 182, 186, 190, 192, 196, 198, 200, 204, 210, 216, 220, 222, 224, 228, 230, 234, 238, 240, 242, 246, 250, 252
Offset: 1

Views

Author

Labos Elemer, May 07 2003

Keywords

Examples

			k = 42 is a term because d = 8 divisors, r = 12 coprimes and u = 23 unrelated belong to it: u = 23 > 19 = 8 + 12 - 1 = d + r - 1.
		

Crossrefs

Programs

  • Maple
    filter:= n -> n > 2*(numtheory:-tau(n) + numtheory:-phi(n)-1):
    select(filter, [$1..1000]); # Robert Israel, May 15 2017
  • Mathematica
    Do[r=EulerPhi[n]; d=DivisorSigma[0, n]; u=n-d-r+1; If[Greater[u, n/2], Print[n, {d, r, u}]], {n, 1, 100}]
    (* Second program: *)
    Select[Range@ 256, # - (DivisorSigma[0, #] + EulerPhi[#] - 1) > #/2 &] (* Michael De Vlieger, Jul 22 2017 *)

Formula

Numbers k such that k - d(k) - phi(k) + 1 > k/2.

A083245 Difference between numbers of related and numbers of unrelated numbers belonging to n: a(n) = A073757(n)-A045763(n) = (n-u(n))-u(n) = n-2*A045763(n) = 2*A073757(n)-n.

Original entry on oeis.org

1, 2, 3, 4, 5, 4, 7, 6, 7, 4, 11, 6, 13, 4, 7, 8, 17, 4, 19, 6, 9, 4, 23, 6, 19, 4, 15, 6, 29, 0, 31, 10, 13, 4, 19, 4, 37, 4, 15, 6, 41, -4, 43, 6, 13, 4, 47, 2, 39, 0, 19, 6, 53, -4, 31, 6, 21, 4, 59, -6, 61, 4, 19, 12, 37, -12, 67, 6, 25, -8, 71, -2, 73, 4, 15, 6, 49, -16, 79, 2, 35, 4, 83, -14, 49, 4, 31, 6, 89, -20, 59, 6, 33, 4, 55, -10, 97, -4
Offset: 1

Views

Author

Labos Elemer, May 07 2003

Keywords

Comments

There are only 2 cases [n=30, n=50] below 10^7 such that a(n) = 0.
No other zeros found up to 10^9. - Michel Marcus, Jul 30 2017

Examples

			n=37, d=2,r=36,u=0, a(37)=2+36-1-0=37>0; primes are fixed points.
n=42, d=8,r=12,u=23,a(42)=8+12-1-23=-4<0, terms of A083244;
n=30, d=8,r=8,u=15, a(30)=0;
n=50, d=6,r=20,u=25,a(50)=0.
		

Crossrefs

Programs

  • Mathematica
    Table[2*(DivisorSigma[0, w]+EulerPhi[w]-1)-w, {w, 1, 1000}]
  • PARI
    a(n) = 2*(numdiv(n)+eulerphi(n)-1) - n; \\ Michel Marcus, Jul 30 2017

Formula

a(n) = 2(A000005(n)+A000010(n)-1)-n.

A083246 Numbers n such that at least one of the following four conditions is satisfied: 1# d(n)=phi(n); 2# d(n)=u(n); 3# phi(n)=u(n), or 4# n=2u(n). Here d(n)=A000005(n) is the number of divisors of n, phi(n)=A000010(n) is Euler's totient and u(n)=A045763(n) is the size of the 'unrelated set'.

Original entry on oeis.org

1, 3, 8, 10, 15, 18, 24, 25, 30, 50, 61455
Offset: 1

Views

Author

Labos Elemer, May 07 2003

Keywords

Comments

Is this sequence complete?

Examples

			1# d(n)=phi(n) holds for {1,3,8,10,18,24,30}, see A020488;
2# d(n)=u(n) holds for {15,25};
3# phi(n)=u(n) holds for {61455};
4# n=2u(n) holds for {30,50}. No more cases below 10^7.
{n,d,r,u} values for 11 initial terms are as follows:
{1, 1, 1, 0}, {3, 2, 2, 0}, {8, 4, 4, 1}, {10, 4, 4, 3}, {15, 4, 8, 4}, {18, 6, 6, 7}{24, 8, 8, 9}, {25, 3, 20, 3}, {30, 8, 8, 15}, {50, 6, 20, 25}, {61455, 16, 30720, 30720}.
		

Crossrefs

Programs

  • Mathematica
    Do[r=EulerPhi[n]; d=DivisorSigma[0, n]; u=n-r-d+1; If[Equal[d, r]||Equal[d, u]||Equal[r, u]||Equal[u, n-u], Print[n(*, {d, r, u}*)]], {n, 1, 10000000}]
  • PARI
    is(n)=my(r=eulerphi(n),d=numdiv(n),u=n-r-d+1);d==r||d==u||r==u||2*u==n \\ Charles R Greathouse IV, Feb 21 2013

A083250 Numbers n for which abs(A045763(n) - A073757(n)) = 3, i.e., signed difference of size of related and unrelated sets to n equals either 3 or -3.

Original entry on oeis.org

3, 825, 1755, 4641, 5313, 56865, 58395, 140049, 159152763, 361701435
Offset: 1

Views

Author

Labos Elemer, May 07 2003

Keywords

Comments

No more terms below 10^9. - Amiram Eldar, Jan 27 2019

Examples

			For n=140049: d=40 divisors, r=70026 coprimes and u=70023 unrelated numbers to n; abs(r-u) = 3.
		

Crossrefs

Programs

  • Mathematica
    Do[r=EulerPhi[n]; d=DivisorSigma[0, n]; u=n-r-d+1; df=2*u-n; If[Equal[Abs[df], 3], Print[n(*, {d, r, u}*)]], {n, 1, 100}]
  • PARI
    isok(n) = abs(n-2*eulerphi(n)-2*numdiv(n)+2) == 3; \\ Michel Marcus, Jul 30 2017

Extensions

a(9)-a(10) from Amiram Eldar, Jan 27 2019

A083251 Numbers n such that abs(A045763(n) - A073757(n)) = 2, i.e., signed difference of size of related and unrelated sets to n equals either 2 or -2.

Original entry on oeis.org

2, 48, 72, 80, 112, 176, 208, 272, 304, 368, 464, 496, 592, 656, 688, 752, 848, 944, 976, 1072, 1136, 1168, 1264, 1328, 1424, 1552, 1616, 1648, 1712, 1744, 1808, 2032, 2096, 2192, 2224, 2384, 2416, 2512, 2608, 2672, 2768, 2864, 2896
Offset: 1

Views

Author

Labos Elemer, May 07 2003

Keywords

Examples

			For n=2896: d=10 divisors, r=1440 coprimes, u=1447 unrelated or n - u = r + d - 1 = 1449 related numbers to n; thus abs(1449 - 1447) = 2.
		

Crossrefs

Programs

  • Mathematica
    Do[r=EulerPhi[n]; d=DivisorSigma[0, n]; u=n-r-d+1; df=2*u-n; If[Equal[Abs[df], 2], Print[n(*, {d, r, u}*)]], {n, 1, 3000}]

Formula

a(n) = 8 * (A076274(n-1) + 1) for n > 3, as proved by Lawrence Sze. - Ralf Stephan, Nov 16 2004

A083247 Numbers k such that A000010(k) > A045763(k) > A000005(k).

Original entry on oeis.org

14, 20, 21, 22, 26, 27, 28, 32, 33, 34, 35, 38, 39, 44, 45, 46, 49, 51, 52, 55, 57, 58, 62, 63, 64, 65, 68, 69, 74, 75, 76, 77, 81, 82, 85, 86, 87, 91, 92, 93, 94, 95, 99, 106, 111, 115, 116, 117, 118, 119, 121, 122, 123, 124, 125, 128, 129, 133, 134, 135, 141, 142
Offset: 1

Views

Author

Labos Elemer, May 07 2003

Keywords

Comments

Primes are not terms since A045763(p) = 0 < A000005(p) = 2 for a prime p.

Examples

			k = 99 is a term since d(k) = 6, phi(k) = 60, unrelateds(k) = 99 - 6 - 60 + 1 = 34, and 60 > 34 > 6 holds.
		

Crossrefs

Programs

  • Mathematica
    Do[r=EulerPhi[n]; d=DivisorSigma[0, n]; u=n-r-d+1; If[Greater[r, u]&&Greater[u, d], Print[n, {d, r, u}]], {n, 1, 1000}]
  • PARI
    is(n)=my(r=eulerphi(n),d=numdiv(n),u=n-r-d+1); r>u && u>d \\ Charles R Greathouse IV, Feb 21 2013

A083248 Numbers k such that A045763(k) > A000010(k) > A000005(k).

Original entry on oeis.org

36, 40, 42, 48, 50, 54, 56, 60, 66, 70, 72, 78, 80, 84, 88, 90, 96, 98, 100, 102, 104, 105, 108, 110, 112, 114, 120, 126, 130, 132, 136, 138, 140, 144, 150, 152, 154, 156, 160, 162, 168, 170, 174, 176, 180, 182, 184, 186, 190, 192, 196, 198, 200, 204, 208, 210
Offset: 1

Views

Author

Labos Elemer, May 07 2003

Keywords

Comments

Primes are not terms since A045763(p) = 0 < A000005(p) = 2 for a prime p.

Examples

			k = 100 is a term since d(k) = 9, phi(k) = 40, unrelateds(k) = 100 - 9 - 40 + 1 = 52, and 52 > 40 > 9 holds.
		

Crossrefs

Programs

  • Mathematica
    Do[r=EulerPhi[n]; d=DivisorSigma[0, n]; u=n-r-d+1; If[Greater[u, r]&&Greater[r, d], Print[n, {d, r, u}]], {n, 1, 1000}]
  • PARI
    isok(k) = {my(f = factor(k), d = numdiv(f), r = eulerphi(f), u = k - r - d + 1); u > r && r > d;} \\ Amiram Eldar, Feb 08 2025

A083252 Numbers k for which abs(A045763(k) - A073757(k)) = 5, i.e., signed difference of size of related and unrelated sets to k equals either 5 or -5.

Original entry on oeis.org

5, 105, 315, 182835, 960075, 7838265, 4291166265
Offset: 1

Views

Author

Labos Elemer, May 07 2003

Keywords

Comments

a(7), if it exists, is > 10^9. - Vaclav Kotesovec, Sep 06 2019

Examples

			For k = 960075: d = 36 divisors, r = 480000 coprimes, u = 480040 unrelated; k - u = r + d - 1 = 480035 related numbers to k; thus abs(480040 - 480035) = 5.
		

Crossrefs

Programs

  • Mathematica
    Do[r=EulerPhi[n]; d=DivisorSigma[0, n]; u=n-r-d+1; df=2*u-n; If[Equal[Abs[df], 5], Print[n(*, {d, r, u}*)]], {n, 1, 3000}]
  • PARI
    isok(n) = abs(n-2*eulerphi(n)-2*numdiv(n)+2) == 5; \\ Michel Marcus, Jul 29 2017

Extensions

a(6) from Michel Marcus, Jul 29 2017
a(7) from Amiram Eldar, Feb 02 2025

A083253 Smallest number k for which abs(A045763(k) - A073757(k)) = n, i.e., signed difference of size of related and unrelated sets to k equals either n or -n.

Original entry on oeis.org

30, 1, 2, 3, 4, 5, 8, 7, 16, 21, 32, 11, 64, 13, 84, 27, 78, 17, 200, 19, 90, 57, 140, 23, 102, 69, 120, 435, 114, 29, 132, 31, 126, 93, 392, 81, 138, 37, 156, 49, 230, 41, 168, 43, 322, 129, 260, 47, 150, 77, 180, 795, 186, 53, 204, 95, 198, 885, 280, 59, 434, 61, 228, 183
Offset: 0

Views

Author

Labos Elemer, May 07 2003

Keywords

Comments

a(258) > 10^5. - Michael De Vlieger, Jul 31 2017

Examples

			A045763(x) - A073757(x) = 0 is first satisfied at x = 30 = a(0).
		

Crossrefs

Programs

  • Mathematica
    With[{s = Table[Abs[n - 2 (DivisorSigma[0, n] + EulerPhi[n] - 1)], {n, 10^3}]}, TakeWhile[#, # > 0 &] &@ Flatten@ Map[FirstPosition[s, #] /. k_ /; MissingQ@ k -> 0 &, Range[0, Max@ s]]] (* Michael De Vlieger, Jul 31 2017 *)
  • PARI
    a(n) = {my(k = 1); while (abs(k - 2*(numdiv(k) + eulerphi(k) - 1)) != n, k++); k;} \\ Michel Marcus, Aug 01 2017

Formula

a(n) = min{x; abs(A045763(x) - A073757(x)) = n}.
a(p) = p, for p prime.
Showing 1-9 of 9 results.