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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A058329 a(n) is smallest positive integer > a(n-1) such that (sum{k=1 to n}[a(k)]) divides (product{k=1 to n}[a(k)])*(sum{k=1 to n}[1/a(k)]). 0
 1, 2, 4, 8, 13, 17, 52, 59, 71, 85, 104, 112, 148, 156, 192, 224, 264, 280, 284, 290, 322, 336, 356, 364, 372, 420, 434, 438, 442, 450, 460, 465, 503, 504, 516, 521, 523, 558, 570, 572, 578, 580, 598, 612, 624, 636, 656, 667, 669, 708, 711, 719, 725, 731, 744 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..55. EXAMPLE a(5) = 13 because 13 is the smallest positive integer m, m > a(4) = 8, such that (1 + 2 + 4 + 8 + m) divides 1 * 2 * 4 * 8 * m * (1 + 1/2 + 1/4 + 1/8 + 1/m). CROSSREFS Sequence in context: A018335 A030058 A346992 * A037380 A328005 A186752 Adjacent sequences: A058326 A058327 A058328 * A058330 A058331 A058332 KEYWORD nonn AUTHOR Leroy Quet, Dec 12 2000 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 March 5 08:40 EST 2024. Contains 370538 sequences. (Running on oeis4.)