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.

A067160 Numbers k such that sigma(phi(sigma(k))) = phi(sigma(phi(k))).

This page as a plain text file.
%I A067160 #19 May 14 2022 11:29:52
%S A067160 1,13,65,157,173,193,1093,1201,1843,2231,2753,3665,12707,13829,15269,
%T A067160 19549,19813,20003,31601,32069,32201,34001,58091,72971,77681,80745,
%U A067160 91505,112241,129899,153409,153851,180521,187777,200413,250961,261313,278513,305761
%N A067160 Numbers k such that sigma(phi(sigma(k))) = phi(sigma(phi(k))).
%C A067160 Are there any even terms in the sequence?
%C A067160 12 of the first 1000 terms are even. - _Donovan Johnson_, Mar 01 2013
%H A067160 Amiram Eldar, <a href="/A067160/b067160.txt">Table of n, a(n) for n = 1..5000</a> (terms 1..1000 from Donovan Johnson)
%t A067160 Select[Range[300000], DivisorSigma[1, EulerPhi[DivisorSigma[1, #]]] == EulerPhi[DivisorSigma[1, EulerPhi[#]]] &] (* _Amiram Eldar_, May 14 2022 *)
%o A067160 (PARI) c=0; for(n=1, 242207369, if(sigma(eulerphi(sigma(n)))==eulerphi(sigma(eulerphi(n))), c++; write("b067160.txt", c " " n))) /* _Donovan Johnson_, Mar 01 2013 */
%Y A067160 Cf. A000010, A000203, A066175, A163370, A163372.
%K A067160 nonn
%O A067160 1,2
%A A067160 _Benoit Cloitre_, Feb 19 2002
%E A067160 Edited by _Dean Hickerson_, Feb 20 2002