|
| |
|
|
A059780
|
|
A generalized Pascal triangle of order 3: T(n,m), n >= 0, 2*n >= m >= 0.
|
|
1
| |
|
|
1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 3, 2, 3, 2, 3, 1, 1, 4, 4, 4, 5, 4, 4, 4, 1, 1, 5, 7, 6, 9, 7, 9, 6, 7, 5, 1, 1, 6, 11, 10, 14, 14, 15, 14, 14, 10, 11, 6, 1, 1, 7, 16, 17, 21, 26, 25, 29, 25, 26, 21, 17, 16, 7, 1, 1, 8, 22, 28, 32, 44, 44, 52, 49, 52, 44, 44, 32, 28, 22, 8, 1, 1, 9, 29, 44, 50
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,6
|
|
|
REFERENCES
| B. A. Bondarenko, Generalized Pascal Triangles and Pyramids (in Russian), FAN, Tashkent, 1990, ISBN 5-648-00738-8. English translation published by Fibonacci Association, Santa Clara Univ., Santa Clara, CA, 1993; see p. 44.
|
|
|
FORMULA
| T(n, m) = T(n-1, m-2)+T(n-1, m-1)+T(n-1, m)-2*T(n-2, m-2). In words, each entry is sum of 3 above it in previous row minus twice entry two places above it.
|
|
|
EXAMPLE
| Triangle begins
. . . 1
. . 1 1 1
. 1 2 1 2 1
1 3 2 3 2 3 1
|
|
|
MAPLE
| T := proc(n, m) option remember: if m=0 then RETURN(1) fi: if m=2*n then RETURN(1) fi: if n=1 and m=1 then RETURN(1) fi: if n=2 and m mod 2 = 0 and m >= 0 and m<=2*n then RETURN(1) fi: if n=2 and m mod 2 = 1 and m >= 0 and m<=2*n then RETURN(2) fi: if m>2*n then RETURN(0) fi: if m<0 then RETURN(0) fi: T(n-1, m-2)+T(n-1, m-1)+T(n-1, m)-2*T(n-2, m-2): end:for n from 0 to 10 do for m from 0 to 2*n do printf(`%d, `, T(n, m)) od: od:
|
|
|
CROSSREFS
| Sequence in context: A135840 A173305 A131332 * A075119 A137278 A205810
Adjacent sequences: A059777 A059778 A059779 * A059781 A059782 A059783
|
|
|
KEYWORD
| nonn,easy,tabf
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Feb 22 2001
|
|
|
EXTENSIONS
| More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Feb 24 2001
|
| |
|
|
