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

A289127 Numbers k such that uphi(k)/uphi(uphi(k)) > uphi(m)/uphi(uphi(m)) for all m < k, where uphi is the unitary totient function (A047994).

Original entry on oeis.org

1, 3, 7, 31, 211, 2311, 32048, 512768, 9737984, 300690391, 6915878971, 8626257644
Offset: 1

Views

Author

Amiram Eldar, Jun 25 2017

Keywords

Crossrefs

The unitary version of A289125.
Cf. A047994.

Programs

  • Mathematica
    uphi[n_] := If[n==1,1,(Times @@ (Table[ #[[1]]^ #[[2]] - 1, {1} ] & /@ FactorInteger[n]))[[1]]]; a = {}; k=1; rmax = 0; While[Length[a]<8,s = uphi[ k]; s2 = uphi[ s]; r = s/s2;  If[r > rmax, AppendTo[a, k]; rmax = r]; k++]; a

Extensions

a(10)-a(12) from Amiram Eldar, Mar 26 2023
Showing 1-1 of 1 results.