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.

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

Original entry on oeis.org

6, 2, 20, 3, 1008, 4, 72, 5, 4400, 144, 835660800, 7, 10800, 8, 272, 9, 9849600, 400, 208039104, 11, 145520912351232000000, 64281600, 3608344625286776094720000, 13, 1296, 84672, 90944, 129600
Offset: 3

Views

Author

Michel Marcus, Sep 17 2018

Keywords

Crossrefs

Cf. A047994 (unitary totient).

Programs

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

Formula

a(2n) = A318842(n).
Showing 1-1 of 1 results.