The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A104455 Expansion of exp(5x)*(BesselI(0,2x)-BesselI(1,2x)). 13
 1, 4, 17, 77, 371, 1890, 10095, 56040, 320795, 1881524, 11250827, 68330773, 420314629, 2612922694, 16389162537, 103587298965, 659071002195, 4217699773140, 27129590096595, 175303621195647, 1137400502295081, 7406899253418414, 48396105031873197, 317180187174490902, 2084542632685363221 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Third binomial transform of A000108. In general, the k-th binomial transform of A000108 will have g.f. (1-sqrt((1-(k+4)x)/(1-kx)))/(2x), e.g.f. exp((k+2)x)(BesselI(0,2x)-BesselI(1,2x)) and a(n)=sum{i=0..n, C(n,i) C(i) k^(n-i)}. Hankel transform of this sequence gives A000012 = [1,1,1,1,1,1,1,...]. - Philippe Deléham, Oct 24 2007 In general, the k-th binomial transform of A000108 can be generated from M^n, M = the production matrix of the form shown in the formula section, with a diagonal (k+1, k+1, k+1,...). - Gary W. Adamson, Jul 21 2011 a(n) is the number of Schroeder paths of semilength n in which the H=(2,0) steps come in 3 colors and having no (2,0)-steps at levels 1,3,5,... - José Luis Ramírez Ramírez, Mar 30 2013 From Tom Copeland, Nov 08 2014: (Start) This array is one of a family of Catalan arrays related by compositions of the special fractional linear (Möbius) transformations P(x,t)=x/(1-t*x); its inverse Pinv(x,t) = P(x,-t); and an o.g.f. of the Catalan numbers A000108, C(x) = [1-sqrt(1-4x)]/2; and its inverse Cinv(x) = x*(1-x). (Cf A091867.) O.g.f.: G(x) = C[P[P[P(x,-1),-1]]-1] = C[P(x,-3)] = [1-sqrt(1-4*x/(1-3x)]/2 = x*A104455(x). Ginv(x) =  Pinv[Cinv(x),-3]= P[Cinv(x),3] = x(1-x)/[1+3x(1-x)] = (x-x^2)/[1+3(x-x^2)] = x*A125145(-x). (Cf. A030528.) (End) LINKS Vincenzo Librandi, Table of n, a(n) for n = 0..200 FORMULA G.f.: (1-sqrt((1-7x)/(1-3x)))/(2x). a(n) = sum{k=0..n, C(n, k)*C(k)*3^(n-k)}. a(n) = 3^n+Sum_{k=0..n-1} a(k)*a(n-1-k), a(0)=1. - Philippe Deléham, Dec 12 2009 From Gary W. Adamson, Jul 21 2011: (Start) a(n) = upper left term of M^n, M = an infinite square production matrix as follows:   4, 1, 0, 0,...   1, 4, 1, 0,...   1, 1, 4, 1,...   1, 1, 1, 4,... (End) Recurrence: (n+1)*a(n) = 2*(5*n-1)*a(n-1) - 21*(n-1)*a(n-2). - Vaclav Kotesovec, Oct 17 2012 a(n) ~ 7^(n+3/2)/(8*sqrt(Pi)*n^(3/2)). - Vaclav Kotesovec, Oct 17 2012 MATHEMATICA CoefficientList[Series[(1-Sqrt[(1-7*x)/(1-3*x)])/(2*x), {x, 0, 20}], x] (* Vaclav Kotesovec, Oct 17 2012 *) PROG (PARI) x='x+O('x^66); Vec((1-sqrt((1-7*x)/(1-3*x)))/(2*x)) \\ Joerg Arndt, Mar 31 2013 CROSSREFS Cf. A007317, A064613. Cf. A000108, A091867, A125145, A030528. Sequence in context: A081922 A124325 A151248 * A123952 A005494 A257072 Adjacent sequences:  A104452 A104453 A104454 * A104456 A104457 A104458 KEYWORD easy,nonn AUTHOR Paul Barry, Mar 08 2005 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 January 26 23:05 EST 2020. Contains 331289 sequences. (Running on oeis4.)