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!)
A225166 Denominators of the sequence s(n) of the sum resp. product of fractions f(n) defined recursively by f(1) = 7/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal. 1
1, 6, 258, 552894, 2881632108858, 87461276190009420415561494, 88945179016152188483365571645414219233310820789054258 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numerators of the sequence s(n) of the sum resp. product of fractions f(n) is A165425(n+2), hence sum(A165425(i+1)/A225159(i),i=1..n) = product(A165425(i+1)/A225159(i),i=1..n) = A165425(n+2)/a(n).
LINKS
FORMULA
a(n) = 7^(2^(n-1))*b(n) where b(n)=b(n-1)-b(n-1)^2 with b(1)=1/7.
EXAMPLE
f(n) = 7, 7/6, 49/43, 2401/2143, ...
7 + 7/6 = 7 * 7/6 = 49/6; 7 + 7/6 + 49/43 = 7 * 7/6 * 49/43 = 2401/258; ...
s(n) = 1/b(n) = 7, 49/6, 2401/258, ...
MAPLE
b:=proc(n) option remember; b(n-1)-b(n-1)^2; end:
b(1):=1/7;
a:=n->7^(2^(n-1))*b(n);
seq(a(i), i=1..8);
CROSSREFS
Sequence in context: A324091 A221895 A015020 * A003384 A316393 A366226
KEYWORD
nonn
AUTHOR
Martin Renner, Apr 30 2013
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 25 06:14 EDT 2024. Contains 371964 sequences. (Running on oeis4.)