|
Search: id:A106597
|
|
|
| A106597 |
|
Triangle T(n,k) (n>=0, 0<=k<=n) read by rows: T(n,0)=T(n,n)=1, T(n,k) = T(n-1,k-1) + T(n-1,k) + Sum_{i >= 1} T(n-2i,k-i). |
|
+0
3
|
|
| 1, 1, 1, 1, 3, 1, 1, 5, 5, 1, 1, 7, 14, 7, 1, 1, 9, 27, 27, 9, 1, 1, 11, 44, 72, 44, 11, 1, 1, 13, 65, 149, 149, 65, 13, 1, 1, 15, 90, 266, 388, 266, 90, 15, 1, 1, 17, 119, 431, 836, 836, 431, 119, 17, 1, 1, 19, 152, 652, 1585, 2150, 1585, 652, 152, 19, 1, 1, 21, 189, 937
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
Next term is sum of two terms above you in previous row (as in Pascal's triangle A007318) plus sum of terms directly above you on a vertical line.
|
|
EXAMPLE
|
Triangle begins:
1; 1,1; 1,3,1; 1,5,5,1; 1,7,14,7,1; ...
|
|
CROSSREFS
|
Sequence in context: A026714 A008288 A144461 this_sequence A108359 A100936 A086620
Adjacent sequences: A106594 A106595 A106596 this_sequence A106598 A106599 A106600
|
|
KEYWORD
|
nonn,tabl,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 30 2005
|
|
EXTENSIONS
|
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 10 2006
Definition corrected by Emilie Hogan, Oct 15 2009
|
|
|
Search completed in 0.002 seconds
|
