This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A225162 Denominators of the sequence of fractions f(n) defined recursively by f(1) = 10/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, 9, 91, 9181, 92480761, 9304615055139121, 93529710772930377727152664652641, 9394835719974970982728198049552322910011762062750179997188274881 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Numerators of the sequence of fractions f(n) is A165428(n+1), hence sum(A165428(i+1)/a(i),i=1..n) = product(A165428(i+1)/a(i),i=1..n) = A165428(n+2)/A225169(n) = A220812(n-1)/A225169(n). LINKS FORMULA a(n) = 10^(2^(n-2)) - product(a(i),i=1..n-1), n > 1 and a(1) = 1. a(n) = 10^(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) = 10, 10/9, 100/91, 10000/9181, ... 10 + 10/9 = 10 * 10/9 = 100/9; 10 + 10/9 + 100/91 = 10 * 10/9 * 100/91 = 10000/819; ... MAPLE b:=n->10^(2^(n-2)); # n > 1 b(1):=10; 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..8); CROSSREFS Cf. A100441, A165428, A220812, A225169. Sequence in context: A068624 A034666 A022505 * A128384 A164913 A007403 Adjacent sequences:  A225159 A225160 A225161 * A225163 A225164 A225165 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 16 06:46 EDT 2019. Contains 324145 sequences. (Running on oeis4.)