The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A054106 Alternating sums of vertically aligned numbers in Pascal's triangle: T(n,k) = C(n,k) - C(n-2,k-1) + C(n-4,k-2) - ... +- C(n-2[n/2],m). 4
 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 3, 5, 3, 1, 1, 4, 8, 8, 4, 1, 1, 5, 12, 15, 12, 5, 1, 1, 6, 17, 27, 27, 17, 6, 1, 1, 7, 23, 44, 55, 44, 23, 7, 1, 1, 8, 30, 67, 99, 99, 67, 30, 8, 1, 1, 9, 38, 97, 166, 197, 166, 97, 38, 9, 1, 1, 10, 47, 135, 263, 363, 363 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,8 LINKS Table of n, a(n) for n=0..72. FORMULA G.f.: 1/(1-(1+y)*x)/(1+y*x^2). - Vladeta Jovovic, Oct 12 2003 EXAMPLE Rows: {1}; {1,1}; {1,1,1}; {1,2,2,1}; {1,3,5,3,1} ... CROSSREFS For (nonalternating) vertically aligned sums, see A013580. Row sums of this array: A007910. Sequence in context: A280267 A161671 A144444 * A132044 A034327 A034254 Adjacent sequences: A054103 A054104 A054105 * A054107 A054108 A054109 KEYWORD nonn,tabl AUTHOR Clark Kimberling STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 10 00:12 EST 2023. Contains 367696 sequences. (Running on oeis4.)