|
Search: id:A114202
|
|
|
| A114202 |
|
A Pascal-Jacobsthal triangle. |
|
+0
5
|
|
| 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 8, 4, 1, 1, 5, 16, 16, 5, 1, 1, 6, 27, 42, 27, 6, 1, 1, 7, 41, 87, 87, 41, 7, 1, 1, 8, 58, 156, 216, 156, 58, 8, 1, 1, 9, 78, 254, 456, 456, 254, 78, 9, 1, 1, 10, 101, 386, 860, 1122, 860, 386, 101, 10, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
Row sums are A114203. T(2n,n) is A114204. Inverse has row sums 0^n.
|
|
REFERENCES
|
Paul Barry, On Integer-Sequence-Based Constructions of Generalized Pascal Triangles, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.4.
|
|
FORMULA
|
As a number triangle, T(n, k)=sum{i=0..n-k, C(n-k, i)C(k, i)J(i)} where J(n)=A001045(n); As a number triangle, T(n, k)=sum{i=0..n, C(n-k, n-i)C(k, i-k)J(i-k)}; As a number triangle, T(n, k)=if(k<=n, sum{i=0..n, C(k, i)C(n-k, n-i)J(k-i)}, 0); As a square array, T(n, k)=sum{i=0..n, C(n, i)C(k, i)J(i)}; As a square array, T(n, k)=sum{i=0..n+k, C(n, n+k-i)C(k, i-k)J(i-k)}; Column k has g.f. sum{i=0..k, C(k, i)J(i+1)(x/(1-x))^i}x^k/(1-x).
|
|
EXAMPLE
|
Triangle begins
1;
1, 1;
1, 2, 1;
1, 3, 3, 1;
1, 4, 8, 4, 1;
1, 5, 16, 16, 5, 1;
1, 6, 27, 42, 27, 6, 1;
1, 7, 41, 87, 87, 41, 7, 1;
|
|
CROSSREFS
|
Sequence in context: A135597 A073134 A026692 this_sequence A125806 A099597 A123610
Adjacent sequences: A114199 A114200 A114201 this_sequence A114203 A114204 A114205
|
|
KEYWORD
|
easy,nonn,tabl
|
|
AUTHOR
|
Paul Barry (pbarry(AT)wit.ie), Nov 16 2005
|
|
|
Search completed in 0.002 seconds
|
