The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A225158 Denominators of the sequence of fractions f(n) defined recursively by f(1) = 6/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal. 2
1, 5, 31, 1141, 1502761, 2555339110801, 7279526598745139799221281, 58396508924557918552199410007906486608310469119041, 3723292553725227196293782783863296586090351965218332181732394788182320381276998127547535467381368961 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Numerators of the sequence of fractions f(n) is A165424(n+1), hence sum(A165424(i+1)/a(i),i=1..n) = product(A165424(i+1)/a(i),i=1..n) = A165424(n+2)/A225165(n) = A173501(n+2)/A225165(n).
LINKS
FORMULA
a(n) = 6^(2^(n-2)) - product(a(i),i=1..n-1), n > 1 and a(1) = 1.
a(n) = 6^(2^(n-2)) - p(n) with a(1) = 1 and p(n) = p(n-1)*a(n-1) with p(1) = 1.
EXAMPLE
f(n) = 6, 6/5, 36/31, 1296/1141, ...
6 + 6/5 = 6 * 6/5 = 36/5; 6 + 6/5 + 36/31 = 6 * 6/5 * 36/31 = 1296/155; ...
MAPLE
b:=n->6^(2^(n-2)); # n > 1
b(1):=6;
p:=proc(n) option remember; p(n-1)*a(n-1); end;
p(1):=1;
a:=proc(n) option remember; b(n)-p(n); end;
a(1):=1;
seq(a(i), i=1..9);
CROSSREFS
Sequence in context: A201307 A228647 A059301 * A299887 A088548 A244622
KEYWORD
nonn,frac
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 June 6 00:30 EDT 2024. Contains 373110 sequences. (Running on oeis4.)