This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A208101 Triangle read by rows: T(n,0) = 1; for n > 0: T(n,1) = n, for n>1: T(n,n) = T(n-1,n-2); T(n,k) = T(n-2,k-1) + T(n-1,k) for k: 1 < k < n. 4
 1, 1, 1, 1, 2, 1, 1, 3, 2, 2, 1, 4, 3, 5, 2, 1, 5, 4, 9, 5, 5, 1, 6, 5, 14, 9, 14, 5, 1, 7, 6, 20, 14, 28, 14, 14, 1, 8, 7, 27, 20, 48, 28, 42, 14, 1, 9, 8, 35, 27, 75, 48, 90, 42, 42, 1, 10, 9, 44, 35, 110, 75, 165, 90, 132, 42, 1, 11, 10, 54, 44, 154, 110 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS Another variant of Pascal's triangle, cf. A007318. LINKS Reinhard Zumkeller, Rows n = 0..150 of triangle, flattened EXAMPLE The triangle begins: 0:                    1 1:                  1   1 2:                1   2   1 3:              1   3   2   2 4:            1   4   3   5   2 5:          1   5   4   9   5   5 6:        1   6   5  14   9  14   5 7:      1   7   6  20  14  28  14  14 8:    1   8   7  27  20  48  28  42  14 9:  1   9   8  35  27  75  48  90  42  42 MATHEMATICA T[_, 0] = 1; T[n_, 1] := n; T[n_, n_] := T[n-1, n-2]; T[n_, k_] /; 1 zipWith (+) ([0, 1] ++ init row) (row ++ [0])) [1] CROSSREFS Cf. A208976 (row sums), A101461 (row max), A208983 (central), A208355 (right edge), A074909. Sequence in context: A016441 A278042 A211161 * A131333 A120643 A242628 Adjacent sequences:  A208098 A208099 A208100 * A208102 A208103 A208104 KEYWORD nonn,tabl AUTHOR Reinhard Zumkeller, Mar 04 2012 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 January 23 04:28 EST 2019. Contains 319370 sequences. (Running on oeis4.)