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.

Showing 1-2 of 2 results.

A001770 Numbers k such that 5*2^k - 1 is prime.

Original entry on oeis.org

2, 4, 8, 10, 12, 14, 18, 32, 48, 54, 72, 148, 184, 248, 270, 274, 420, 1340, 1438, 1522, 1638, 1754, 1884, 2014, 2170, 2548, 2622, 2652, 2704, 13510, 21738, 25624, 41934, 51478, 52540, 53230, 172300, 245728, 350028, 1194164
Offset: 1

Views

Author

Keywords

Comments

A084213(a(n)+1) is in A136539, for all n. - Farideh Firoozbakht and M. F. Hasler, Nov 03 2012

References

  • N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Cf. A002254 (5*2^n+1 is prime), A050522 (primes of the form 5*2^n - 1).

Programs

Extensions

More terms from Hugo Pfoertner, Jun 23 2004
a(40) from the Wilfrid Keller link by Robert Price, Dec 22 2018

A136539 Numbers n such that n=6*phi(n)-sigma(n).

Original entry on oeis.org

76, 1264, 327424, 5241856, 83881984, 1342160896, 343597121536
Offset: 1

Views

Author

Farideh Firoozbakht, Jan 05 2008, Feb 01 2008

Keywords

Comments

If 5*2^n-1 is prime (that is, n is in A001770) then m = 2^n*(5*2^n-1) is in the sequence. Proof: 6*phi(m)-sigma(m) = 6*2^(n-1)*(5*2^n-2) -(2^(n+1)-1)*5*2^n = 30*2^(2n-1)-6*2^n-5*2^(2n+1)+5*2^n = 5*2^(2n)-2^n = 2^n(5*2^n-1) = m.
The first seven terms of the sequence are of such form, with n=2, 4, 8, 10, 12, 14, 18. Are all terms of the sequence of this form?
a(8) > 10^12. - Giovanni Resta, Nov 03 2012

Examples

			6*phi(76)-sigma(76)=6*36-140=76 so 76 is in the sequence.
		

Crossrefs

Programs

  • Mathematica
    Do[If[n==6*EulerPhi[n]-DivisorSigma[1,n],Print[n]],{n,85000000}]

Formula

a(n) = 2^k*(5*2^k-1) = A084213(k+1) with k = A001770(n), for n = 1,...,7. - M. F. Hasler, Nov 03 2012

Extensions

a(7) from Giovanni Resta, Nov 03 2012
Showing 1-2 of 2 results.