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!)
A108176 a(1) = 1, a(n) = (Sum_{k=1..floor(n/2)} 1/a(n + 1 - 2k))*(Product_{k=1..floor(n/2)} a(n + 1 - 2k)). 1

%I #12 Aug 17 2017 22:32:03

%S 1,1,1,2,3,7,23,164,3786,620973,2351006074,1459911295051236,

%T 3432260322166663402961472,5010795611887306064313121202903094714708,

%U 17198354961167628388233455836547370709483687001035342768448084064

%N a(1) = 1, a(n) = (Sum_{k=1..floor(n/2)} 1/a(n + 1 - 2k))*(Product_{k=1..floor(n/2)} a(n + 1 - 2k)).

%F For n >= 2, a(n+4) = a(n+1)*(a(n+2) - a(n)a(n+1)) + a(n+2)a(n+3).

%p a[1]:=1: for n from 2 to 25 do a[n]:=sum(1/a[n+1-2*j],j=1..floor(n/2))*product(a[n+1-2*k],k=1..floor(n/2)) od: seq(a[n],n=1..16); # _Emeric Deutsch_, Jun 14 2005

%t a[1] = 1; a[n_] := a[n] = Sum[1/a[n + 1 - 2k], {k, Floor[n/2]}] Product[ a[n + 1 - 2k], {k, Floor[n/2]}]; Table[ a[n], {n, 15}] (* _Robert G. Wilson v_, Jun 14 2005 *)

%Y Cf. A057438.

%K nonn

%O 1,4

%A _Leroy Quet_, Jun 13 2005

%E More terms from _Robert G. Wilson v_ and _Emeric Deutsch_, Jun 14 2005

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 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)