login
This site is supported by donations to The OEIS Foundation.
Logo

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; internal format)
OFFSET

0,8

FORMULA

G.f.: 1/(1-(1+y)*x)/(1+y*x^2). - Vladeta Jovovic (vladeta(AT)eunet.rs), 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: A034928 A161671 A144444 * A132044 A034327 A034254

Adjacent sequences:  A054103 A054104 A054105 * A054107 A054108 A054109

KEYWORD

nonn,tabl

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:21 EST 2012. Contains 205785 sequences.