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.

A318842 a(n) is the least integer m such that A047994(m) = ((n-1)/n)*m where A047994 is the unitary totient function, or 0 if there is no such m.

Original entry on oeis.org

2, 3, 4, 5, 144, 7, 8, 9, 400, 11, 64281600, 13, 84672, 129600, 16, 17, 518400, 19, 4327213363200, 254016, 6326996189184000000, 23, 300174920860041216000, 25, 2747437056, 27, 3136, 29
Offset: 2

Views

Author

Michel Marcus, Sep 04 2018

Keywords

Comments

If it is not 0, a(30) > 10^30. - Michel Marcus, Sep 08 2018

Crossrefs

Cf. A000961 (primepowers), A047994 (unitary totient).
Cf. A145680 (analog with unitary sigma).

Programs

  • PARI
    \\ uses the "solve_uphi pari code", see links
    a(n) = {my(lim = 1, v); while (1, v = solve_uphi(n-1, n, lim); if (#v, return (v[1])); lim *= 10;);}

Formula

a(pp) = pp iff pp is a prime power (A000961) > 1.
Showing 1-1 of 1 results.