This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160565 Diagonal sums of number triangle [k<=n]*C(n,2n-2k)2^(n-k)A000108(n-k). 3
 1, 0, 1, 2, 1, 6, 9, 12, 41, 60, 121, 310, 505, 1162, 2577, 4760, 11089, 23256, 47089, 107274, 223345, 476366, 1061017, 2237796, 4888313, 10745748, 23048169, 50792638, 111180265, 241786898, 534219297 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Hankel transform is A160566(n+1). a(0)=1 followed by A025252. [From R. J. Mathar, May 20 2009] LINKS FORMULA G.f.: (1-x^2-sqrt(1-2x^2-8x^3+x^4))/(4x^3); G.f.: 1/(1-x^2-2*x^3/(1-x^2-2*x^3/(1-x^2-2*x^3/(1-x^2-2*x^3/(1-... (continued fraction). a(n)=sum{k=0..floor(n/2), C(n-k,2n-4k)*2^(n-2k)*A000108(n-2k)}; a(n)=sum{k=0..n, C(n-k/2,2(n-k))*2^(n-k)*A000108(n-k)*(1+(-1)^k)/2}; a(n)=sum{k=0..n, C((n+k)/2,2k)*2^k*A000108(k)(1+(-1)^(n-k))/2}. G.f.: (1/(1-x^2))c(2x^3/(1-x^2)^2) where c(x) is the g.f. of A000108. [From Paul Barry, May 20 2009] CROSSREFS Cf.: A025250. Sequence in context: A263255 A145663 A276664 * A025252 A177863 A193601 Adjacent sequences:  A160562 A160563 A160564 * A160566 A160567 A160568 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 October 20 12:47 EDT 2019. Contains 328257 sequences. (Running on oeis4.)