login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057438 a(1) = 1; a(n+1) = product_{k = 1 to n} [a(k)] *sum_{j = 1 to n} [1/a(j)]. 6
1, 1, 2, 5, 27, 739, 546391, 298543324411, 89128116550480609893151, 7943821159836055611643954282977557048699079331, 63104294619459055797454850600852928915607093463575707111291209057699988334565551829102647591 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

FORMULA

a(n) = a(n-1)^2+a(n-1)a(n-2)-a(n-2)^3 (valid for all n>3). - Ivan Sadofschi (ivansadofschi(AT)gmail.com), Feb 22 2011

a(n) = a(n-1)^2+A074056(n-2) where A074056 is partial product of A057438. Close to a(n-1)^2+a(n-1)*0.365177806085453... and 1.1087260396143829635274191...^(2^n). - Henry Bottomley (se16(AT)btinternet.com), Aug 14 2002

EXAMPLE

a(5) = a(1)*a(2)*a(3)*a(4)*(1/a(1) + 1/a(2) + 1/a(3) + 1/a(4)) = 1*1*2*5*(1 + 1 + 1/2 + 1/5) = 27.

MATHEMATICA

a[1] = 1; a[n_] := a[n] = Sum[1/a[n - k], {k, n - 1}] Product[a[n - k], {k, n - 1}]; Table[ a[n], {n, 11}] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 14 2005)

CROSSREFS

Cf. A074046, A074056, A108176.

Sequence in context: A203195 A207324 A058182 * A002795 A127357 A025170

Adjacent sequences:  A057435 A057436 A057437 * A057439 A057440 A057441

KEYWORD

easy,nonn

AUTHOR

Leroy Quet Sep 08 2000

EXTENSIONS

More terms from Leroy Quet Sep 08 2000

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:19 EST 2012. Contains 206038 sequences.