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!)
A266269 a(n) is the smallest number k such that phi(k) >= n*phi(k-1). 1
2, 3, 7, 211, 30031, 223092871, 13082761331670031, 3217644767340672907899084554131 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(3) = 7 because 7 is the smallest number k such that phi(k) >= n*phi(k-1); phi(7) = 6 >= 3*phi(6) = 3*2.
PROG
(Magma) a:=func<n | exists(r){k:k in[2..10^7] | Floor(EulerPhi(k) / EulerPhi(k-1)) eq n}select r else 0>; [a(n):n in[1..5]]
(PARI) a(n) = {my(k=2, e=1); while(n*e > e=eulerphi(k), k++); k; } \\ Jinyuan Wang, Nov 01 2020
CROSSREFS
Cf. A000010 (phi), A266276 (the smallest k such that phi(k) = n*phi(k-1)).
Sequence in context: A053924 A130060 A224894 * A053942 A053954 A063869
KEYWORD
nonn,more
AUTHOR
Jaroslav Krizek, Jan 26 2016
EXTENSIONS
a(6)-a(8) from Jinyuan Wang, Nov 01 2020
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 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)