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

%I #7 Apr 09 2014 10:16:57

%S 1,2,4,3,7,602,292174,200550,21353,14210,6174,2744,8852,5554,3494,

%T 7220,1536,2520,1620,1236,896,784,1764,140,2560,240,1128,3240,1512,

%U 280,800,243,4557,245,1579,666,135,2079,2646,4650,250,1862,528,496,152,304,88

%N 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)]).

%e 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).

%K nonn

%O 1,2

%A _Leroy Quet_, Dec 12 2000

%E More terms from _Naohiro Nomoto_, Jun 26 2001

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 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)