[go: up one dir, main page]

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!)
A058330 a(n) is smallest positive integer, distinct from any terms earlier in the sequence, 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, 3, 7, 602, 292174, 200550, 21353, 14210, 6174, 2744, 8852, 5554, 3494, 7220, 1536, 2520, 1620, 1236, 896, 784, 1764, 140, 2560, 240, 1128, 3240, 1512, 280, 800, 243, 4557, 245, 1579, 666, 135, 2079, 2646, 4650, 250, 1862, 528, 496, 152, 304, 88 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(4) = 3 because 3 is smallest positive integer m, not = to 1, 2, or 4, where (1 + 2 + 4 + m) divides 1 * 2 * 4 * m * (1 + 1/2 + 1/4 + 1/m).
CROSSREFS
Sequence in context: A309201 A360145 A253792 * A124256 A108503 A331595
KEYWORD
nonn
AUTHOR
Leroy Quet, Dec 12 2000
EXTENSIONS
More terms from Naohiro Nomoto, Jun 26 2001
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 August 30 15:13 EDT 2024. Contains 375545 sequences. (Running on oeis4.)