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!)
A225164 Denominators of the sequence s(n) of the sum resp. product of fractions f(n) defined recursively by f(1) = 5/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, 4, 84, 45444, 15686405364, 2147492192737717340004, 45388476229808808857318702720533556450342484 (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 A165423(n+2), hence s(n) = sum(A165423(i+1)/A225157(i),i=1..n) = product(A165423(i+1)/A225157(i),i=1..n) = A165423(n+2)/a(n) = A176594(n-1)/a(n).
LINKS
FORMULA
a(n) = 5^(2^(n-1))*b(n) where b(n)=b(n-1)-b(n-1)^2 with b(1)=1/5.
EXAMPLE
f(n) = 5, 5/4, 25/21, 625/541, ...
5 + 5/4 = 5 * 5/4 = 25/4; 5 + 5/4 + 25/21 = 5 * 5/4 * 25/21 = 625/84; ...
s(n) = 1/b(n) = 5, 25/4, 625/84, ...
MAPLE
b:=proc(n) option remember; b(n-1)-b(n-1)^2; end:
b(1):=1/5;
a:=n->5^(2^(n-1))*b(n);
seq(a(i), i=1..8);
CROSSREFS
Sequence in context: A015018 A204245 A287248 * A229185 A360741 A184100
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 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)