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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A180460 a(n) is the smallest number m such that sigma(m)=22^n, or 0 if m does not exist. 6
 1, 0, 0, 10363, 136647, 3018141, 66411009, 1636922343, 31276995183, 688217286267, 15200749439001, 324029599659171, 7264291502741679, 160447401116572437, 3530475812620849113, 75514126111770824037, 1662716417771040164631, 36586320846189859358019, 804905851136700392012493, 17704604426749226872106319 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Conjecture: Given any even integer E not a power of 2 (see A078426) there exists a positive integer N such that for all n>=N the equation sigma(m)=E^n has at least one solution for m. LINKS Max Alekseyev, Table of n, a(n) for n = 0..100 EXAMPLE a(4)=136647=3^4*7*241 since sigma(3^4*7*241)=(11^2)(2^3)(2*11^2)=2^4*11^4 and 136647 is the smallest such number. CROSSREFS Cf. A048251, A110077, A180265, A180461, A180462, A180463, A180464. Sequence in context: A097695 A031803 A234907 * A035912 A226599 A374272 Adjacent sequences: A180457 A180458 A180459 * A180461 A180462 A180463 KEYWORD nonn AUTHOR Walter Kehowski, Sep 06 2010 EXTENSIONS Terms a(37) onward (in b-file) from Max Alekseyev, Mar 04 2014 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.

Last modified July 25 01:41 EDT 2024. Contains 374585 sequences. (Running on oeis4.)