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!)
A226104 Numbers n such that phi(n)+3 divides n+3. 2
1, 30, 42, 66, 78, 102, 114, 138, 174, 186, 195, 222, 246, 258, 282, 318, 354, 366, 402, 426, 438, 474, 498, 534, 582, 606, 618, 642, 654, 678, 762, 786, 822, 834, 894, 906, 942, 978, 1002, 1038, 1074, 1086, 1146, 1158, 1182, 1194, 1266, 1338, 1362, 1374, 1398 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
MATHEMATICA
Select[Range[2000], IntegerQ[(# + 3)/(EulerPhi[#] + 3)] &]
PROG
(PARI) is(n)=(n+3)%(eulerphi(n)+3)==0 \\ Charles R Greathouse IV, Nov 13 2013
(Python)
from sympy import totient as phi
def ok(n): return (n+3) % (phi(n)+3) == 0
print([m for m in range(1, 1400) if ok(m)]) # Michael S. Branicky, Jan 30 2021
CROSSREFS
Cf. A000010 (Euler's totient function).
Cf. A207574 (numbers n such that phi(n)+2 divides n+2).
Cf. A202855 (numbers n such that phi(n)-1 divides n).
Cf. A203966 (numbers n such that phi(n) divides n+1).
Sequence in context: A160352 A291446 A342398 * A091455 A367481 A219742
KEYWORD
nonn
AUTHOR
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 12 16:59 EDT 2024. Contains 371635 sequences. (Running on oeis4.)