|
| |
|
|
A097806
|
|
Riordan array (1+x,1) read by rows.
|
|
44
| |
|
|
1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1
(list; table; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| Pair sum operator. Columns have g.f. (1+x)x^k. Row sums are A040000. Diagonal sums are (1,1,1,....). Riordan inverse is (1/(1+x), 1). A097806=B*A059260^(-1), where B is the binomial matrix.
Triangle T(n,k), 0<=k<=n, read by rows given by [1, -1, 0, 0, 0, 0, 0, ...] DELTA [1, 0, 0, 0, 0, 0, 0, ...] where DELTA is the operator defined in A084938 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), May 01 2007
|
|
|
FORMULA
| Number triangle T(n, k)=if(n=k or n-k=1, 1, 0).
a(n)=A103451(n+1). - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 16 2007
|
|
|
EXAMPLE
| Rows begin {1}, {1,1}, {0,1,1}, {0,0,1,1}...
|
|
|
CROSSREFS
| Sequence in context: A116938 A105589 * A167374 A085357 A132971 A011748
Adjacent sequences: A097803 A097804 A097805 * A097807 A097808 A097809
|
|
|
KEYWORD
| easy,nonn,tabl
|
|
|
AUTHOR
| Paul Barry (pbarry(AT)wit.ie), Aug 25 2004
|
| |
|
|
