This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160568 Diagonal sums of number triangle [k<=n]*C(n,2n-2k)3^(n-k)A000108(n-k). 1
 1, 0, 1, 3, 1, 9, 19, 18, 91, 165, 271, 990, 1765, 3843, 11467, 21630, 53299, 140724, 287119, 736101, 1818235, 3982044, 10225117, 24521409, 56584243, 143641017, 341948179, 816095982, 2045559205, 4888806237, 11897144767, 29540684052 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Hankel transform is A160569(n+1). LINKS FORMULA G.f.: (1-x^2-sqrt(1-2x^2-12x^3+x^4))/(6*x^3); G.f.: 1/(1-x^2-3*x^3/(1-x^2-3*x^3/(1-x^2-3*x^3/(1-x^2-3*x^3/(1-... (continued fraction). a(n)=sum{k=0..floor(n/2), C(n-k,2n-4k)*3^(n-2k)*A000108(n-2k)}; a(n)=sum{k=0..n, C(n-k/2,2(n-k))*3^(n-k)*A000108(n-k)*(1+(-1)^k)/2}; a(n)=sum{k=0..n, C((n+k)/2,2k)*3^k*A000108(k)(1+(-1)^(n-k))/2}. CROSSREFS Cf.: A025250, A160565. Sequence in context: A121489 A118793 A247231 * A157403 A225118 A273464 Adjacent sequences:  A160565 A160566 A160567 * A160569 A160570 A160571 KEYWORD easy,nonn AUTHOR Paul Barry, May 19 2009 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 February 17 18:46 EST 2019. Contains 320222 sequences. (Running on oeis4.)