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.

A065528 Numbers n such that phi(n) is a nontrivial power b^c where b > 1 and c > 1.

This page as a plain text file.
%I A065528 #21 Nov 08 2017 07:44:22
%S A065528 5,8,10,12,15,16,17,20,24,30,32,34,37,40,48,51,57,60,63,64,68,74,76,
%T A065528 80,85,96,101,102,108,114,120,125,126,128,136,160,170,185,192,197,202,
%U A065528 204,219,240,247,250,255,256,257,259,272,273,285,292,296,304,315,320,327,333
%N A065528 Numbers n such that phi(n) is a nontrivial power b^c where b > 1 and c > 1.
%C A065528 What values of b can occur?
%C A065528 Apparently all even numbers can occur as values of b. Checked up to 50000; see A227533. - _Charles R Greathouse IV_, Jul 15 2013
%H A065528 Charles R Greathouse IV, <a href="/A065528/b065528.txt">Table of n, a(n) for n = 1..10000</a>
%F A065528 a(n) = A166955(n+2). - _Juri-Stepan Gerasimov_, Oct 25 2009
%e A065528 phi(63) = 6^2, phi(96) = 2^5.
%t A065528 ppQ[n_] := GCD @@ Last /@ FactorInteger@ n > 1; Select[ Range@ 330, ppQ@ EulerPhi@ # &] (* _Robert G. Wilson v_, Jul 16 2013 *)
%o A065528 (PARI) v=[]; for(n=2, 333, if(ispower(eulerphi(n)), v=concat(v, n))); v (Hobson)
%o A065528 (PARI) is(n)=ispower(eulerphi(n)) \\ _Charles R Greathouse IV_, Jul 15 2013
%Y A065528 Cf. A166955.
%K A065528 nonn,easy
%O A065528 1,1
%A A065528 _Joseph L. Pe_, Nov 27 2001
%E A065528 More terms from Nick Hobson, Nov 29 2006
%E A065528 b-file from _Charles R Greathouse IV_, Mar 25 2010