This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A094717 a(n)=n!*sum(i+2j+3k=n, 0<=i<=n, 0<=j<=n, 0<=k<=n, 1/i!/(2j)!/(3k)!). 2
 1, 1, 2, 5, 12, 36, 113, 351, 1080, 3281, 9882, 29646, 88817, 266085, 797526, 2391485, 7173360, 21520080, 64563521, 193700403, 581120892, 1743392201, 5230206126, 15690618378, 47071766561, 141215033961, 423644570442, 1270932914165 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS FORMULA Limit n ->infty a(n)/3^n=1/6 E.g.f.: exp(z)*cosh(z)*(exp(z)+2*exp(-z/2)*cos(z*sqrt(3/4)))/3. - Peter Luschny, Jul 11 2012 Empirical G.f.: -(2*x^5-2*x^4+5*x^3-8*x^2+5*x-1) / ((x-1)*(3*x-1)*(x^2+x+1)*(3*x^2-3*x+1)). - Colin Barker, Dec 24 2012 MAPLE A094717_list := proc(n) local i; exp(z)*cosh(z)*(exp(z)+2*exp(-z/2)* cos(z*sqrt(3/4)))/3; series(%, z, n+2); seq(simplify(i!*coeff(%, z, i)), i=0..n) end: A094717_list(27); # Peter Luschny, Jul 11 2012 PROG (PARI) a(n)=sum(i=0, n, sum(j=0, n, sum(k=0, n, if(n-i-2*j-3*k, 0, n!/(i)!/(2*j)!/(3*k)!)))) CROSSREFS Cf. A094715, A024493. Sequence in context: A303204 A032203 A197444 * A038142 A287427 A267397 Adjacent sequences:  A094714 A094715 A094716 * A094718 A094719 A094720 KEYWORD nonn AUTHOR Benoit Cloitre, May 23 2004 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 December 13 22:07 EST 2018. Contains 318087 sequences. (Running on oeis4.)