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.

A292557 a(n) is the smallest number k such that 2k - sigma(k) = 2^n.

Original entry on oeis.org

3, 5, 22, 17, 250, 134, 262, 257, 6556, 4124, 10330, 8198, 91036, 19649, 65542, 65537, 1442716, 524294, 1363258, 4194332, 4411642, 16442342, 16866106, 22075325, 156791188, 536871032, 2160104368, 536870918, 1074187546, 2147483654, 4295862586, 19492545788
Offset: 1

Views

Author

XU Pingya, Sep 19 2017

Keywords

Comments

Primes of the form 2^n+1, i.e., Fermat primes (A019434) are terms of this sequence.
For n > 32, a(n) > 2 * 10^10.

Examples

			sigma(20) - 2*20 = 2^1, a(1) = 20.
sigma(108) - 2*108 = 64 = 2^6, a(6) = 108.
		

Crossrefs

Programs

  • Mathematica
    Table[k = 1; While[Log[2, 2k - DivisorSigma[1, k]] != n, k++]; k, {n, 31}]
  • PARI
    a(n) = my(k=1); while(2*k - sigma(k) != 2^n, k++); k; \\ Michel Marcus, Sep 19 2017