This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A099092 Riordan array (1,2+4x). 0
 1, 0, 2, 0, 4, 4, 0, 0, 16, 8, 0, 0, 16, 48, 16, 0, 0, 0, 96, 128, 32, 0, 0, 0, 64, 384, 320, 64, 0, 0, 0, 0, 512, 1280, 768, 128, 0, 0, 0, 0, 256, 2560, 3840, 1792, 256, 0, 0, 0, 0, 0, 2560, 10240, 10752, 4096, 512, 0, 0, 0, 0, 0, 1024, 15360, 35840, 28672, 9216, 1024, 0, 0, 0 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Row sums are A063727. Diagonal sums are A052907. The Riordan array (1,s+tx) defines T(n,k)=binomial(k,n-k)s^k(t/s)^(n-k). The row sums satisfy a(n)=s*a(n-1)+t*a(n-2) and the diagonal sums satisfy a(n)=s*a(n-2)+t*a(n-3). LINKS FORMULA Number triangle T(n, k)=binomial(k, n-k)*2^n; columns have g.f. (2x+4x^2)^k. T(n,k)= A113953(n,k)*2^k = A026729(n,k)*2^n. [From Philippe Deléham, Dec 11 2008] EXAMPLE Rows begin {1}, {0,2}, {0,4,4}, {0,0,16,8}, {0,0,16,48,16}, ... CROSSREFS Cf. A038210. Sequence in context: A277333 A248663 A093443 * A177806 A286550 A307658 Adjacent sequences:  A099089 A099090 A099091 * A099093 A099094 A099095 KEYWORD easy,nonn,tabl AUTHOR Paul Barry, Sep 25 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 October 18 20:17 EDT 2019. Contains 328197 sequences. (Running on oeis4.)