cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A087270 #7 Oct 26 2019 22:27:32
%S A087270 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 A087270 62,63,64,66,72,75,77,78,80,82,90,92,93,94,96,100,102,105,108,114,115,
%U A087270 116,117,118,120,122,123,124,125,126,132,134,136,138,140,142,144,146
%N 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.
%t A087270 t=Table[GCD[w, PrimePi[w]], {w, 1, 1000}]; Flatten[Position[Sign[t-1], 1]]
%Y A087270 Cf. A007053, A000720, A087266-A087269, A057809.
%K A087270 nonn
%O A087270 1,1
%A A087270 _Labos Elemer_, Sep 16 2003