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

A068581 Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_4(k) = tau(k).

Original entry on oeis.org

1, 17, 23, 29, 31, 37, 43, 51, 55, 65, 69, 77, 82, 87, 91, 93, 94, 95, 106, 111, 118, 122, 128, 129, 133, 134, 136, 142, 146, 158, 165, 170, 184, 195, 218, 230, 231, 232, 238, 243, 246, 248, 250, 254, 273, 282, 285, 286, 290, 296, 297, 310, 318, 322, 344, 351
Offset: 1

Views

Author

Benoit Cloitre, Mar 26 2002

Keywords

Comments

Last term is a(132) = 7560.
Numbers k such that A049100(k) = A000005(k).

Crossrefs

Programs

  • Mathematica
    Select[Range[351], Nest[EulerPhi, #, 4] === DivisorSigma[0, #] &] (* Amiram Eldar, Jun 12 2022 *)

A068582 Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_5(k) = tau(k).

Original entry on oeis.org

1, 41, 47, 53, 59, 61, 67, 71, 73, 79, 85, 109, 115, 119, 123, 125, 127, 141, 143, 145, 155, 159, 161, 163, 166, 177, 178, 183, 185, 194, 201, 202, 203, 206, 209, 213, 214, 215, 217, 219, 226, 237, 247, 255, 259, 262, 278, 298, 301, 302, 314, 327, 328, 343
Offset: 1

Views

Author

Benoit Cloitre, Mar 26 2002

Keywords

Comments

Last term is a(340) = 24570.
Numbers k such that A049107(k) = A000005(k).

Crossrefs

Programs

  • Mathematica
    Select[Range[343], Nest[EulerPhi, #, 5] === DivisorSigma[0, #] &] (* Amiram Eldar, Jun 12 2022 *)

A068580 Let phi_m(x) = phi(phi(...(phi(x))...)) m times; sequence gives values of k such that phi_2(k) = tau(k).

Original entry on oeis.org

1, 5, 7, 15, 21, 22, 26, 40, 56, 66, 70, 78, 108, 120, 126, 168, 210
Offset: 1

Views

Author

Benoit Cloitre, Mar 26 2002

Keywords

Comments

Numbers k such that A010554(k) = A000005(k).

Crossrefs

Programs

  • Mathematica
    Select[Range[210], Nest[EulerPhi, #, 2] === DivisorSigma[0, #] &] (* Amiram Eldar, Jun 12 2022 *)
  • PARI
    is(k) = numdiv(k) == eulerphi(eulerphi(k)); \\ Jinyuan Wang, Apr 05 2020
Showing 1-3 of 3 results.