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 A068414 #25 May 14 2022 11:30:08 %S A068414 1,12,56,260,992,1976,2156,2754,16256,25232,41072,133984,145888, %T A068414 1100864,1270208,1439552,2237888,4729664,67100672,75398912,171627376, %U A068414 277060144,473089984,538178048,558585344,629225984,1192258048,1863840112,2181070592,4534854656 %N A068414 Numbers k such that sigma(k) = 3k - 2*phi(k). %C A068414 If 2^p-1 is prime (a Mersenne prime) and n = 2^p*(2^p-1) then n is in the sequence because 3*n-2*phi(n) = 3*2^p*(2^p-1)-2^p*(2^p-2) = 2^p*(2^(p+1)-1) = sigma(2^p-1)*sigma(2^p) = sigma(2^p*(2^p-1)) = sigma(n). - _Farideh Firoozbakht_, Dec 31 2005 %t A068414 Select[Range[10^6], DivisorSigma[1, #] == 3*# - 2*EulerPhi[#] &] (* _Amiram Eldar_, May 14 2022 *) %o A068414 (PARI) for(n=1,500000, if(sigma(n)==3*n-2*eulerphi(n),print1(n,","))) %Y A068414 Cf. A000010, A000203, A068418, A069719, A069737. %K A068414 nonn %O A068414 1,2 %A A068414 _Benoit Cloitre_, Mar 03 2002 %E A068414 More terms (complete up to 50000000). - _Rick L. Shepherd_, Mar 28 2002 %E A068414 More terms from _Labos Elemer_, Apr 03 2002 %E A068414 a(24)-a(30) from _Donovan Johnson_, Feb 08 2012