login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A362489 a(n) is the least number k such that the equation iphi(x) = k has exactly 2*n solutions, or -1 if no such k exists, where iphi is the infinitary totient function A091732. 1
5, 1, 6, 12, 36, 24, 396, 48, 216, 96, 528, 144, 384, 2784, 432, 240, 1296, 288, 1584, 1800, 480, 1680, 1080, 864, 576, 3240, 2016, 960, 6624, 720, 1152, 7776, 12000, 8448, 5280, 1728, 10752, 2304, 4032, 4800, 6048, 3840, 2160, 5184, 4608, 6336, 1440, 10560, 29568 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(n) is the least number k such that A362485(k) = 2*n. Odd values of A362485 are impossible.
Is there any n for which a(n) = -1?
LINKS
MATHEMATICA
solnum[n_] := Length[invIPhi[n]]; seq[len_, kmax_] := Module[{s = Table[-1, {len}], c = 0, k = 1, ind}, While[k < kmax && c < len, ind = solnum[k]/2 + 1; If[ind <= len && s[[ind]] < 0, c++; s[[ind]] = k]; k++]; s]; seq[50, 10^5] (* using the function invIPhi from A362484 *)
CROSSREFS
Similar sequences: A007374, A063507, A361970, A362186.
Sequence in context: A160824 A193586 A007397 * A204203 A261721 A275490
KEYWORD
nonn
AUTHOR
Amiram Eldar, Apr 22 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 27 19:37 EDT 2024. Contains 375471 sequences. (Running on oeis4.)