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!)
A048251 a(n) is the smallest number whose sum of divisors is 6^n. 14
1, 5, 22, 102, 510, 3210, 17490, 112890, 600270, 3466470, 20205570, 118879530, 697118730, 3949737330, 24217298490, 143487592710, 841422307110, 4973562896610, 29520886859310, 180254162529210, 1052751138726210, 6301225298627490, 37854941354933010, 224270177470178070 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
Terms of this sequence are products of distinct terms in A005105. - Ray Chandler, Sep 01 2010
LINKS
FORMULA
a(n) = Min{k : A000203(k) = 6^n}.
EXAMPLE
sigma(k) = 1296 = 6^4 for each k in {510, 642, 710, 742, 782, 795, 862, 935, 1177, 1207, 1219}; the smallest of these is a(4)=510.
PROG
(PARI) a(n) = {my(k=1); while (sigma(k) != 6^n, k++); k; } \\ Michel Marcus, May 14 2018
CROSSREFS
Sequence in context: A179602 A262440 A296044 * A017971 A308807 A017972
KEYWORD
nonn
AUTHOR
EXTENSIONS
a(9)-a(14) from Donovan Johnson, Sep 02 2008
a(15)-a(24) from Walter Kehowski, Aug 22 2010
Edited and extended by Ray Chandler, Sep 01 2010
Error in sequence corrected by N. J. A. Sloane, Oct 04 2010
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 23 08:33 EDT 2024. Contains 371905 sequences. (Running on oeis4.)