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.
%I A062377 #19 Dec 22 2022 15:45:14
%S A062377 275,341,451,550,671,682,775,781,902,1111,1271,1342,1375,1441,1550,
%T A062377 1562,1661,1775,1991,2101,2201,2222,2321,2542,2651,2750,2761,2882,
%U A062377 2911,2981,3025,3091,3131,3275,3322,3421,3550,3641,3751,3775,3875,3982,4061
%N A062377 Euler phi(n) / Carmichael lambda(n) = 10.
%C A062377 Solutions to A000010(n)/A002322(n)=10.
%H A062377 R. J. Mathar, <a href="/A062377/b062377.txt">Table of n, a(n) for n = 1..7771</a>
%t A062377 Reap[ For[ n = 1, n <= 4061, n++, If[ EulerPhi[n] / CarmichaelLambda[n] == 10, Sow[n]]]][[2, 1]] (* _Jean-François Alcover_, Mar 26 2013 *)
%t A062377 Select[Range[4100],EulerPhi[#]/CarmichaelLambda[#]==10&] (* _Harvey P. Dale_, Dec 22 2022 *)
%o A062377 (PARI) {cmf(f)=if( ((f[1]==2)&&(f[2]>2)),eulerphi(f[1]^f[2])/2, eulerphi(f[1]^f[2])) } {cl(f)= k=factor(f); l=1; for(x=1,omega(f),l=lcm(l,cmf([k[x,1], k[x,2]]))); l } {A062377(n)=eulerphi(n)/cl(n)} for(x=1,10001, if(A062377(x)==10,print1(x,",")))
%Y A062377 Cf. A000010, A002322, A034380, A033948, A062373, A062374, A062375, A062376.
%K A062377 easy,nonn
%O A062377 1,1
%A A062377 _Vladeta Jovovic_, Jun 17 2001
%E A062377 More terms from _Randall L Rathbun_, Jan 12 2002