login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A043343
Numbers m such that there is no k > m such that phi(k) = phi(m), where phi is Euler's totient function.
5
2, 6, 12, 18, 22, 30, 42, 46, 54, 58, 60, 62, 66, 90, 94, 98, 106, 118, 120, 126, 134, 138, 142, 150, 158, 162, 166, 174, 198, 206, 210, 214, 240, 242, 250, 254, 262, 270, 274, 276, 278, 282, 294, 298, 302, 318, 330, 334, 346, 348, 354, 358, 378, 382, 394, 398
OFFSET
1,1
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..980 from Paul Tek)
FORMULA
A066659(a(n)) = 0.
A028476(a(n)) = a(n).
MATHEMATICA
Flatten@ Position[#, 0] &@ Table[k = n + 1; While[And[k <= 2 n + 1, EulerPhi@ k != EulerPhi@ n], k++]; Boole[k < 2 n + 1] k, {n, 400}] (* Michael De Vlieger, Dec 31 2016 *)
PROG
(PARI) is(k) = #select(x -> x>k, invphi(eulerphi(k))) == 0; \\ Amiram Eldar, Nov 12 2024, using Max Alekseyev's invphi.gp
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladeta Jovovic, Jan 12 2002
EXTENSIONS
Offset corrected by Paul Tek, Sep 25 2015
Definition clarified by Alonso del Arte, Dec 31 2016
STATUS
approved