[go: up one dir, main page]

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!)
Revision History for A225156 (Underlined text is an addition; strikethrough text is a deletion.)

Showing all changes.
A225156 Denominators of the sequence of fractions f(n) defined recursively by f(1) = 3/1; f(n+1) is chosen so that the sum and the product of the first n terms of the sequence are equal.
(history; published version)
#6 by N. J. A. Sloane at Wed May 01 12:07:16 EDT 2013
STATUS

editing

approved

#5 by N. J. A. Sloane at Wed May 01 12:07:03 EDT 2013
KEYWORD

nonn,frac,changed

STATUS

proposed

editing

Discussion
Wed May 01 12:07
N. J. A. Sloane: added missing keyword
#4 by Martin Renner at Tue Apr 30 19:09:10 EDT 2013
STATUS

editing

proposed

#3 by Martin Renner at Tue Apr 30 19:02:47 EDT 2013
COMMENTS

Numerators of the sequence of fractions f(n) is A165421(n+1), hence sum(A165421(i+1)/a(i),i=1..n) = product(A165421(i+1)/a(i),i=1..n) = A165421(n+2)/A000000A225163(n) = A011764(n-1)/A000000A225163(n).

CROSSREFS

Cf. A011764, A100441, A165421, A225163.

#2 by Martin Renner at Tue Apr 30 17:54:00 EDT 2013
NAME

allocatedDenominators of the sequence of fractions f(n) defined recursively by f(1) = 3/1; f(n+1) is chosen so that the sum and the product of the first n terms of the forsequence Martinare Rennerequal.

DATA

1, 2, 7, 67, 5623, 37772347, 1653794703916063, 3104205768420613437667191487267, 10767416908549848056705041797805600349527548164015760674541223

OFFSET

1,2

COMMENTS

Numerators of the sequence of fractions f(n) is A165421(n+1), hence sum(A165421(i+1)/a(i),i=1..n) = product(A165421(i+1)/a(i),i=1..n) = A165421(n+2)/A000000(n) = A011764(n-1)/A000000(n).

LINKS

Paul Yiu, <a href="http://math.fau.edu/yiu/RecreationalMathematics2003.pdf">Recreational Mathematics</a>, Department of Mathematics, Florida Atlantic University, 2003, Chapter 5.4, p. 207 (Project).

FORMULA

a(n) = 3^(2^(n-2)) - product(a(i),i=1..n-1), n > 1 and a(1) = 1.

a(n) = 3^(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) = 3, 3/2, 9/7, 81/67, ...

3 + 3/2 = 3 * 3/2 = 9/2; 3 + 3/2 + 9/7 = 3 * 3/2 * 9/7 = 81/14; ...

MAPLE

b:=n->3^(2^(n-2)); # n > 1

b(1):=3;

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

Cf. A011764, A100441, A165421.

KEYWORD

allocated

nonn

AUTHOR

Martin Renner, Apr 30 2013

STATUS

approved

editing

#1 by Martin Renner at Tue Apr 30 17:54:00 EDT 2013
NAME

allocated for Martin Renner

KEYWORD

allocated

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 August 29 18:55 EDT 2024. Contains 375518 sequences. (Running on oeis4.)