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!)
A066278 Least solution to cototient(x) = n!, where cototient(x) = x-phi(x). 0
2, 4, 10, 36, 168, 1008, 7056, 56448, 470400, 4704000, 51528960, 618347520, 7740902400, 108372633600 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(15) <= 1625589504000. a(16) <= 26009432064000. a(17) <= 442160345088000. [Donovan Johnson, Feb 05 2010]
LINKS
FORMULA
a(n) = Min{x; x-A000010(x)=n!} = Min{A051953(x)=A000142(n)}.
EXAMPLE
Solutions to x-Phi[x]=720 are {1008,1424,1432,1436,1438} of which the smallest is a(6)=1008.
PROG
(PARI) a(n) = my(x=1); while(x-eulerphi(x) != n!, x++); x; \\ Michel Marcus, Aug 24 2019
CROSSREFS
Sequence in context: A192502 A243567 A323949 * A210773 A210774 A210775
KEYWORD
nonn,more
AUTHOR
Labos Elemer, Dec 10 2001
EXTENSIONS
a(12)-a(14) from Donovan Johnson, Feb 05 2010
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 11 16:46 EDT 2024. Contains 375073 sequences. (Running on oeis4.)