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.

A115747 Numbers n such that phi(n) + sigma(n) = 5/2*n.

Original entry on oeis.org

18, 20, 88, 368, 1504, 24448, 98048, 5238976, 25161728, 2730992944, 33995232256, 412316336128, 1391737114624, 7732492570624
Offset: 1

Views

Author

Farideh Firoozbakht, Feb 12 2006

Keywords

Comments

If p = 3*2^(m-1)-1 is an odd prime then 2^m*p is in the sequence because phi(2^m*p) = 2^(m-1)*(3*2^(m-1)-2), sigma(2^m*p) = (2^(m+1)-1)*(3*2^(m-1)) so phi(2^m*p)+sigma(2^m*p) = 2^(m-1)*(3* 2^(m-1)-2)+(2^(m+1)-1)*(3*2^(m-1)) = 3*2^(2m-2)-2^m+3*2^(2m)-3*2^ (m-1) = 2^(m-1)*(3*2^(m-1)-2+3*2^(m+1)-3) = 2^(m-1)*(3*5*2^(m-1)-5) = 5/2*2^m*(3*2^(m-1)-1) = 5/2*(2^m*p). Except 18 & 5238976 all known terms of the sequence are of the form 2^m*(3*2^(m-1)-1), where (3*2^(m-1)-1) is prime.
a(15) > 10^13. - Giovanni Resta, Jul 13 2015

Examples

			25161728 is in the sequence because phi(25161728) + sigma(25161728) = 12578816 + 50325504 = 5/2*25161728.
		

Crossrefs

Cf. A002235.

Programs

  • Mathematica
    Do[If[DivisorSigma[1,n]+EulerPhi[n]==5/2*n,Print[n]],{n,200000000}]
  • PARI
    isok(n) = eulerphi(n) + sigma(n) == 5*n/2; \\ Michel Marcus, Jul 14 2015

Extensions

a(10)-a(12) from Donovan Johnson, Feb 29 2012
a(13) from Donovan Johnson, Apr 04 2012
a(14) from Giovanni Resta, Jul 13 2015