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.

A362183 Unitary highly cototient numbers: numbers k that have more solutions x to the equation A323410(x) = k than any smaller k.

Original entry on oeis.org

0, 6, 10, 20, 31, 47, 53, 65, 77, 89, 113, 119, 149, 167, 179, 209, 293, 299, 329, 359, 389, 419, 479, 509, 599, 629, 779, 839, 989, 1049, 1139, 1259, 1469, 1559, 1649, 1679, 1889, 2099, 2309, 2729, 3149, 3359, 3569, 3989, 4289, 4409, 4619, 5249, 5459, 6089, 6509
Offset: 1

Views

Author

Amiram Eldar, Apr 10 2023

Keywords

Comments

Indices of records of A362181.
The corresponding numbers of solutions are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 16, 17, 21, ... (A362184).

Crossrefs

The unitary version of A100827.
Similar sequences: A097942, A361968.

Programs

  • Mathematica
    ucototient[n_] := n - Times @@ (Power @@@ FactorInteger[n] - 1); ucototient[1] = 0; With[{max = 300}, solnum = Table[0, {n, 1, max}]; Do[If[(i = ucototient[k]) <= max, solnum[[i]]++], {k, 2, max^2}]; s = {0}; solmax=1; Do[sol = solnum[[k]]; If[sol > solmax, solmax = sol; AppendTo[s, k]], {k, 2, max}]; s]