This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A116385 E.g.f. Bessel_I(2,2x)+2*Bessel_I(3,2x)+Bessel_I(4,2x). 3
 0, 0, 1, 2, 5, 10, 21, 42, 84, 168, 330, 660, 1287, 2574, 5005, 10010, 19448, 38896, 75582, 151164, 293930, 587860, 1144066, 2288132, 4457400, 8914800, 17383860, 34767720, 67863915, 135727830, 265182525, 530365050, 1037158320, 2074316640 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Third column of the Riordan array A116382. Apart from its root term -1: central terms of the triangle in A051631: a(n) = A051631(n+1, [(n+1)/2]). [Reinhard Zumkeller, Nov 13 2011] LINKS Reinhard Zumkeller, Table of n, a(n) for n = 0..1000 FORMULA E.g.f.: dif(Bessel_I(3,2x),x)+2*Bessel_I(3,2x); a(n)=C(n+1,floor((n-2)/2)(1+(-1)^n)/2+C(n,floor((n-3)/2))(1-(-1)^n). Conjecture: (n+4)*a(n) -2*a(n-1) +(-7*n-8)*a(n-2) +6*a(n-3) +12*(n-2)*a(n-4)=0. - R. J. Mathar, Jun 13 2014 MATHEMATICA With[{nn=40}, CoefficientList[Series[BesselI[2, 2x]+2BesselI[3, 2x]+ BesselI[ 4, 2x], {x, 0, nn}], x]Range[0, nn]!] (* Harvey P. Dale, Sep 14 2011 *) PROG (Haskell) a116385 n = a051631 (n+1) \$ (n+1) `div` 2 -- Reinhard Zumkeller, Nov 13 2011 CROSSREFS Sequence in context: A212531 A261681 A030525 * A267515 A215411 A243988 Adjacent sequences:  A116382 A116383 A116384 * A116386 A116387 A116388 KEYWORD easy,nonn AUTHOR Paul Barry, Feb 12 2006 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 August 18 04:50 EDT 2019. Contains 326072 sequences. (Running on oeis4.)