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!)
A350777 Numbers k where phi(k) divides k - 3. 4
1, 2, 3, 9, 195, 5187, 1141967133868035, 3658018932844533311864835 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numbers in this sequence larger than 2 have to be odd, since phi(n) is even for n > 2, so n - 3 cannot be odd. Therefore n itself must be odd.
Terms having (k-3)/phi(k) = 2 are shared with A226105. - Max Alekseyev, Oct 26 2023
LINKS
EXAMPLE
phi(195) = 96, 195 - 3 = 192, and 96 divides 192.
MATHEMATICA
Select[Range[6000], Divisible[#-3, EulerPhi[#]] &] (* Amiram Eldar, Jan 19 2022 *)
PROG
(PARI) isok(k) = !((k-3) % eulerphi(k)); \\ Michel Marcus, Jan 19 2022
(Python)
from sympy import totient
print("1, 2", end=", ")
for k in range (3, 10**8, 2):
if (k-3)%totient(k)==0:
print(k, end=", ", flush=True) # Martin Ehrenstein, Mar 26 2022
CROSSREFS
Sequence in context: A333474 A251543 A332203 * A248236 A319157 A153702
KEYWORD
nonn,more
AUTHOR
EXTENSIONS
a(7)-a(8) from Max Alekseyev, Nov 5 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 20 22:53 EDT 2024. Contains 375341 sequences. (Running on oeis4.)