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!)
A087270 Solutions to gcd(x,pi(x)) = gcd(x, A000720(x)) > 1. Numbers x such that x and pi(x) have common divisor larger than one. 0

%I #7 Oct 26 2019 22:27:32

%S 4,6,8,10,14,15,16,20,22,24,27,30,33,38,39,40,44,46,48,50,51,54,56,58,

%T 62,63,64,66,72,75,77,78,80,82,90,92,93,94,96,100,102,105,108,114,115,

%U 116,117,118,120,122,123,124,125,126,132,134,136,138,140,142,144,146

%N Solutions to gcd(x,pi(x)) = gcd(x, A000720(x)) > 1. Numbers x such that x and pi(x) have common divisor larger than one.

%t t=Table[GCD[w, PrimePi[w]], {w, 1, 1000}]; Flatten[Position[Sign[t-1], 1]]

%Y Cf. A007053, A000720, A087266-A087269, A057809.

%K nonn

%O 1,1

%A _Labos Elemer_, Sep 16 2003

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 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)