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.

A362211 a(n) is the unique solution to A323410(x) = A362185(n).

Original entry on oeis.org

1, 6, 15, 21, 35, 11392, 1688, 10048, 53632, 101632, 5272, 2632, 6616, 50368, 1386, 102016, 1716, 1722, 161152, 4356, 11992, 92992, 4716, 101312, 589312, 2634, 644608, 3538, 3778, 898048, 30896, 16312, 3610, 3510, 4702, 1432576, 4626, 606976, 8908, 3738, 343936
Offset: 1

Views

Author

Amiram Eldar, Apr 11 2023

Keywords

Crossrefs

Similar sequences: A131826, A362212.

Programs

  • Mathematica
    ucototient[n_] := n - Times @@ (Power @@@ FactorInteger[n] - 1); ucototient[1] = 0; With[{max = 3000}, sol = solnum = Table[0, {n, 1, max}]; Do[If[(i = ucototient[k]) <= max, sol[[i]] = k; solnum[[i]]++], {k, 2, max^2}]; Join[{1}, sol[[Position[solnum, 1] // Flatten]]]]

Formula

A323410(a(n)) = A362185(n).

A362665 a(n) is the smaller of the two solutions to A091732(x) = A362664(n).

Original entry on oeis.org

1, 3, 4, 5, 11, 16, 33, 23, 29, 43, 69, 64, 47, 53, 76, 87, 59, 71, 79, 83, 141, 101, 103, 159, 107, 177, 131, 137, 213, 149, 163, 249, 167, 173, 236, 179, 235, 191, 197, 303, 309, 265, 321, 253, 223, 227, 229, 316, 239, 332, 251, 256, 393, 263, 269, 411, 283
Offset: 1

Views

Author

Amiram Eldar, Apr 29 2023

Keywords

Comments

The larger solution is 2*a(n).

Crossrefs

Similar sequences: A131826, A362211, A362212.

Programs

  • Mathematica
    invIPhi[#][[1]]& /@ Select[Range[300], Length[invIPhi[#]] == 2 &] (* using the function invIPhi from A362484 *)
Showing 1-2 of 2 results.