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.

A092584 Numbers k such that sigma(phi(k)) == phi(sigma(k)) (mod k), that is, A033632(k)/k is an integer.

This page as a plain text file.
%I A092584 #11 Mar 12 2020 07:27:47
%S A092584 1,5,9,157,225,242,516,729,3872,13932,14406,17672,18225,20124,21780,
%T A092584 29262,29616,45996,65025,76832,92778,95916,106092,106308,114630,
%U A092584 114930,121872,125652,140130,140625,145794,149124,160986,179562,185100,234876
%N A092584 Numbers k such that sigma(phi(k)) == phi(sigma(k)) (mod k), that is, A033632(k)/k is an integer.
%H A092584 Amiram Eldar, <a href="/A092584/b092584.txt">Table of n, a(n) for n = 1..2000</a>
%e A092584 Includes but is not identical with A033632.
%e A092584 Below 10^7 only a(2) = 5 and a(4) = 157 give A033632(n)/n nonzero.
%t A092584 Select[Range[250000], Divisible[DivisorSigma[1, EulerPhi[#]] - EulerPhi[DivisorSigma[1, #]] , #] &]  (* _Amiram Eldar_, Mar 12 2020 *)
%o A092584 (PARI) is(n)=sigma(eulerphi(n))==Mod(eulerphi(sigma(n)),n) \\ _Charles R Greathouse IV_, Nov 27 2013
%Y A092584 Cf. A033632, A092585, A092586, A092587, A092588, A065395.
%K A092584 nonn
%O A092584 1,2
%A A092584 _Labos Elemer_, Mar 01 2004