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-1 of 1 results.

A247956 a(n) is the smallest number k such that sigma(k) = 2^n or 0 if no such k exists.

Original entry on oeis.org

1, 0, 3, 7, 0, 21, 0, 93, 217, 381, 651, 0, 2667, 8191, 11811, 24573, 57337, 82677, 172011, 393213, 761763, 1572861, 2752491, 5332341, 11010027, 21845397, 48758691, 85327221, 199753347, 341310837, 677207307, 1398273429, 3220807683, 6192353757, 10836557067
Offset: 0

Views

Author

Jaroslav Krizek, Sep 28 2014

Keywords

Comments

See A078426 for numbers n such that there is no solution to the equation sigma(x) = 2^n.
If a(n) > 0, then it is a term of A046528 (numbers that are a product of distinct Mersenne primes).

Examples

			a(0) = 1 because 1 is the smallest number k with sigma(1) = 1 = 2^0.
a(5) = 21 because 21 is the smallest number k with sigma(k) = 32 = 2^5.
a(6) = 0 because there is no number k with sigma(k) = 64 = 2^6.
		

Crossrefs

Programs

  • PARI
    a(n) = for (k=1, 2^n, if (sigma(k)== 2^n, return (k))); return (0); \\ Michel Marcus, Oct 03 2014, Oct 31 2015
    
  • PARI
    a(n) = max(0, invsigmaMin(1<Amiram Eldar, Dec 31 2024, using Max Alekseyev's invphi.gp (see links).

Formula

a(A078426(n)) = 0.
a(A182221(n)) > 0.

Extensions

a(0) = 1 prepended by Michel Marcus, Oct 31 2015
Showing 1-1 of 1 results.