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!)
A066900 a(n) = max( {k : phi(k)==n (mod(k)) } ). 1
2, 6, 2, 12, 3, 18, 2, 30, 5, 22, 3, 42, 7, 10, 9, 60, 3, 54, 5, 66, 11, 46, 15, 90, 13, 6, 7, 58, 5, 62, 2, 120, 21, 14, 3, 126, 19, 30, 5, 150, 7, 98, 11, 138, 27, 94, 3, 210, 5, 34, 13, 106, 33, 162, 7, 174, 29, 118, 35, 198, 31, 14, 39, 240, 11, 134, 17, 46, 45, 142 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
PROG
(PARI) a(n) = {my(v = invphi(n), m = if (#v, vecmax(v), n)); vecmax(select(x->(Mod(eulerphi(x), x) == n), [1..m])); } \\ Michel Marcus, Feb 22 2021; needs invphi
CROSSREFS
Sequence in context: A292522 A243197 A319048 * A356016 A336852 A079462
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Jan 24 2002
EXTENSIONS
More terms from Michel Marcus, Feb 22 2021
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 April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)