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.

A361970 a(n) is the least number k such that the equation uphi(x) = k has exactly n solutions, or -1 if no such k exists, where uphi is the unitary totient function (A047994).

Original entry on oeis.org

5, 1, 2, 6, 8, 12, 36, 156, 24, 552, 168, 48, 96, 420, 120, 192, 3264, 144, 384, 336, 1536, 288, 360, 240, 672, 1200, 3888, 1080, 4896, 1584, 480, 576, 7056, 4992, 864, 1872, 1152, 3120, 960, 2400, 720, 2520, 30960, 2688, 19968, 1680, 1728, 1920, 2016, 2304, 12000
Offset: 0

Views

Author

Amiram Eldar, Apr 01 2023

Keywords

Comments

Is there any n for which a(n) = -1?

Crossrefs

The unitary version of A007374.

Programs

  • Mathematica
    solnum[n_] :=  Length[invUPhi[n]]; seq[len_, kmax_] := Module[{s = Table[-1, {len}], c = 0, k = 1, ind}, While[k < kmax && c < len, ind = solnum[k] + 1; If[ind <= len && s[[ind]] < 0, c++; s[[ind]] = k]; k++]; s]; seq[50, 10^5] (* using the function invUPhi from A361966 *)

Formula

A361967(a(n)) = n.