login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247956 a(n) is the smallest number k such that sigma(k) = 2^n or 0 if no such k exists. 2
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
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).
LINKS
FORMULA
a(A078426(n)) = 0.
a(A182221(n)) > 0.
EXAMPLE
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.
PROG
(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
CROSSREFS
Sequence in context: A199068 A198490 A354797 * A295043 A074051 A335918
KEYWORD
nonn
AUTHOR
Jaroslav Krizek, Sep 28 2014
EXTENSIONS
a(0) = 1 prepended by Michel Marcus, Oct 31 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)