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

A226386 Numbers n such that rad(phi(n)) < phi(rad(n)), where rad(n) is the squarefree kernel of n, and phi is Euler's totient function.

Original entry on oeis.org

5, 10, 13, 15, 17, 19, 20, 21, 26, 29, 30, 33, 34, 35, 37, 38, 39, 40, 41, 42, 45, 51, 52, 53, 55, 57, 58, 60, 61, 63, 65, 66, 68, 69, 70, 73, 74, 76, 77, 78, 80, 82, 84, 85, 87, 89, 90, 91, 93, 95, 97, 101, 102, 104, 105, 106, 109, 110, 111, 113, 114, 115
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    rad[n_] := Product[fa[n][[i, 1]], {i, Length[fa[n]]}]; fa = FactorInteger; Select[Range[500], rad[EulerPhi[#]] < EulerPhi[rad[#]] &]
  • PARI
    rad(n)=my(f=factor(n)[,1]);prod(i=1,#f,f[i])
    is(n)=my(f=factor(n)[,1],r=prod(i=1,#f,f[i]),ph=prod(i=1,#f,f[i]-1)*n/r); rad(ph)Charles R Greathouse IV, Dec 13 2013

A226385 Numbers n such that rad(phi(n)) > phi(rad(n)), where rad(n) is the squarefree kernel of n, and phi is Euler's totient function.

Original entry on oeis.org

4, 8, 9, 16, 18, 25, 27, 32, 36, 49, 50, 54, 64, 72, 75, 81, 98, 99, 100, 108, 121, 125, 128, 144, 147, 150, 162, 169, 175, 196, 198, 200, 207, 216, 225, 242, 243, 245, 250, 256, 288, 289, 294, 297, 300, 324, 338, 343, 350, 361, 363, 375, 392, 396, 400, 414
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    rad[n_] := Product[fa[n][[i, 1]], {i,Length[fa[n]]}]; fa = FactorInteger; Select[Range[500], rad[EulerPhi[#]] > EulerPhi[rad[#]] &]
  • PARI
    rad(n)=my(f=factor(n)[,1]); prod(i=1,#f,f[i])
    is(n)=rad(eulerphi(n))>eulerphi(rad(n)) \\ Charles R Greathouse IV, Dec 27 2013
Showing 1-2 of 2 results.