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

A077090 When iteration of f(x) = phi(sigma(x) - phi(x)) is started at initial values listed here it ends up in a cycle of length greater than 1.

Original entry on oeis.org

36, 40, 48, 50, 52, 60, 64, 66, 72, 76, 78, 80, 81, 84, 88, 90, 92, 96, 98, 100, 102, 105, 106, 108, 110, 112, 114, 116, 117, 118, 120, 122, 123, 124, 126, 128, 130, 132, 135, 136, 138, 140, 141, 142, 144, 146, 147, 148, 150, 152, 154, 156, 159, 160, 162, 164
Offset: 1

Views

Author

Labos Elemer, Oct 31 2002

Keywords

Comments

Below 2000 there are only these two cycles of length 3: 36, 78, 48; and 144, 280, 192.
For most composite numbers below 80, the iterated trajectory of f settles on a single-number cycle of 4; those numbers are not in this sequence. - Alonso del Arte, Nov 29 2013

Examples

			36 is in the sequence because f(36) = 78, f(78) = 48 and f(48) = 36, which is a cycle of length 3.
38 is not in the sequence because iterating f from 38 gives the trajectory 38, 12, 8, 10, 6, 4, 4, 4, ... where the cycle has a length of 1.

Links

Crossrefs

Cf. A077088, A077091, A077092, A077093, A077094, A077095, A077096.

Programs

  • Mathematica
    f[x_] := EulerPhi[DivisorSigma[1, x] - EulerPhi[x]]; Do[s = NestList[f, n, 100]; s1 = Part[s, 98]; s2 = Part[s, 99]; s3 = Part[s, 100]; If[ !Equal[s1, s2], k = k + 1; Print[{k, n, s1, s2, s3}]], {n, 2, 1000}]
f[n_] := EulerPhi[DivisorSigma[1, n]-EulerPhi[n]]; cycleQ[n_] := With[{nn = NestWhileList[f, n, Unequal, All]}, nn[[-1]] != nn[[-2]]]; Select[Range[200], cycleQ] (* Jean-François Alcover, Nov 29 2013 *)
  • PARI
    f(x)=if(x>35,eulerphi(sigma(x)-eulerphi(x)),1)
is(n)=my(t=f(n),h=f(t)); while(t!=h, h=f(f(h)); t=f(t)); f(t)!=t \\ Charles R Greathouse IV, Nov 29 2013

Extensions

Name corrected by Charles R Greathouse IV, Nov 29 2013

A077092 Fixed points of iteration in A077091.

Original entry on oeis.org

0, 4, 24, 8064, 34944, 35520, 38880, 69480, 268560, 420096, 1054944, 2946560, 3054080, 5660160, 6621120, 9768960, 10264320, 25885760, 29062656, 33933312, 36484992, 38707200, 78532608, 163418112, 260601600, 458987520, 4044349440
Offset: 1

Views

Author

Labos Elemer, Oct 31 2002

Keywords

Comments

When iteration of f(k) = phi(sigma(k)-phi(k)) is started at various initial values, not ending in cycles and converging, it ends at these fixed points.
a(28) <= 11435212800. a(29) <= 15083274240. a(30) <= 90215424000. - Donovan Johnson, Dec 14 2009

Examples

			n=30: FixedPointList={30,32,46,20,16,22,12,8,10,6,4},end=4; n=94: FixedPointList={94,42,24},end=24. n=41708: FixedPointList={41708,26064,32352,21216,15232,8064},end=8064; n=12100: FixedPointList={12100,24000,34944},end=34944.

Crossrefs

Cf. A077090, A077091, A077093, A077094, A077095, A077096, A077099, A077100.

Programs

  • Mathematica
    f[x_] := EulerPhi[DivisorSigma[1, x]-EulerPhi[x]] Do[s=NestList[f, n, 100]; s1=Part[s, 99]; s2=Part[s, 100]; If[Equal[s1, s2]&&!PrimeQ[n], Print[{n, s1}]], {n, 1, 1000}]

Extensions

a(9) corrected and a(11)-a(27) from Donovan Johnson, Dec 14 2009

A077094 Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 4.

Original entry on oeis.org

4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 25, 26, 27, 28, 30, 32, 33, 34, 35, 38, 39, 44, 45, 46, 49, 51, 54, 55, 56, 57, 58, 62, 63, 65, 68, 70, 77, 85, 87, 91, 93, 95, 99, 104, 111, 119, 121, 129, 134, 143, 145, 153, 158, 161, 169, 189, 205, 209, 215, 221, 245
Offset: 1

Views

Author

Labos Elemer, Oct 31 2002

Keywords

Comments

Probably this sequence is finite, with 92 terms of which the last is 6241.

Examples

			n=6241: FixedPointList={6241,104,54,32,20,16,22,12,8,10,6,4}, end=4.

Links

Crossrefs

Cf. A000010 (phi), A000203 (sigma).
Cf. A077090, A077091, A077092, A077093, A077095, A077096.

Programs

  • Mathematica
    f[x_] := EulerPhi[DivisorSigma[1, x]-EulerPhi[x]]; Do[s=NestList[f, n, 100]; s1=Part[s, 99]; s2=Part[s, 100]; If[Equal[s1, s2]&&Equal[s1, 4], Print[{n, s1}]], {n, 1, 1000000}]
f4[n_]:=FixedPoint[EulerPhi[DivisorSigma[1,#]-EulerPhi[#]]&,n,50]==4; Select[Range[250],f4] (* Harvey P. Dale, May 01 2021 *)

Extensions

Definition corrected by Harvey P. Dale, May 01 2021

A077091 Composites c, such that when iteration of f(k) = phi(sigma(k)-phi(k)) is started at c it ends at a fixed point > 1.

Original entry on oeis.org

4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, 34, 35, 38, 39, 42, 44, 45, 46, 49, 51, 54, 55, 56, 57, 58, 62, 63, 65, 68, 69, 70, 74, 75, 77, 82, 85, 86, 87, 91, 93, 94, 95, 99, 104, 111, 115, 119, 121, 125, 129, 133, 134, 143, 145, 153
Offset: 1

Views

Author

Labos Elemer, Oct 31 2002

Keywords

Examples

			n=30: FixedPointList={30,32,46,20,16,22,12,8,10,6,4},end=4; n=94:FixedPointList={94,42,24},end=24.

Crossrefs

Cf. A077090, A077092, A077093, A077094, A077095, A077096.

Programs

  • Mathematica
    f[x_] := EulerPhi[DivisorSigma[1, x]-EulerPhi[x]] Do[s=NestList[f, n, 100]; s1=Part[s, 99]; s2=Part[s, 100]; If[Equal[s1, s2]&&!PrimeQ[n], Print[{n, s1}]], {n, 1, 1000}]

Extensions

1 removed by Sean A. Irvine, May 05 2025

A077095 Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 24.

Original entry on oeis.org

24, 42, 69, 74, 75, 82, 86, 94, 115, 125, 133, 155, 185, 187, 203, 289, 299, 323, 341, 361, 377, 437, 1681
Offset: 1

Views

Author

Labos Elemer, Oct 31 2002

Keywords

Comments

Probably this sequence is finite, with 23 terms of which the last is 1681.

Examples

			n=1641: FixedPointList={1681,82,42,24}, end=24.

Crossrefs

Cf. A000010 (phi), A000203 (sigma).
Cf. A077090, A077091, A077092, A077093, A077094, A077096.

Programs

  • Mathematica
    f[x_] := EulerPhi[DivisorSigma[1, x]-EulerPhi[x]]; Do[s=NestList[f, n, 100]; s1=Part[s, 99]; s2=Part[s, 100]; If[Equal[s1, s2]&&Equal[s1, 4], Print[{n, s1}]], {n, 1, 1000000}]
fp24Q[n_]:=FixedPoint[EulerPhi[DivisorSigma[1,#]-EulerPhi[#]]&,n,20]==24; Select[ Range[1700],fp24Q] (* Harvey P. Dale, Mar 12 2023 *)

A077096 Numbers k such that iterating phi(sigma(k)-phi(k)) starting from k leads to the fixed point 8064.

Original entry on oeis.org

7530, 8064, 9678, 9828, 9990, 10002, 10290, 10464, 11000, 11004, 11172, 11350, 11510, 11572, 11814, 11930, 12006, 12192, 12348, 12472, 12636, 12654, 12726, 12750, 12772, 12972, 13332, 13372, 13420, 13440, 13626, 13648, 13656, 13695
Offset: 1

Views

Author

Labos Elemer, Oct 31 2002

Keywords

Examples

			n=41354: FixedPointList={41354,13440,15232,8064}, end=8064.

Crossrefs

Cf. A077090, A077091, A077092, A077093, A077094, A077095.

Programs

  • Mathematica
    f[x_] := EulerPhi[DivisorSigma[1, x]-EulerPhi[x]] Do[s=NestList[f, n, 100]; s1=Part[s, 99]; s2=Part[s, 100]; If[Equal[s1, s2]&&Equal[s1, 8064], Print[n]], {n, 1, 1000000}]
fp[n_]:=FixedPoint[EulerPhi[DivisorSigma[1,#]-EulerPhi[#]]&,n,100]==8064; Select[ Range[14000],fp] (* Harvey P. Dale, May 05 2013 *)
Showing 1-6 of 6 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.