|
|
A152198
|
|
Triangle read by rows, A007318 rows repeated.
|
|
18
|
|
|
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 3, 3, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 1, 4, 6, 4, 1, 1, 5, 10, 10, 5, 1, 1, 5, 10, 10, 5, 1, 1, 6, 15, 20, 15, 6, 1, 1, 6, 15, 20, 15, 6, 1, 1, 7, 21, 35, 35, 21, 7, 1, 1, 7, 21, 35, 35, 21, 7, 1, 1, 8, 28, 56, 70, 56, 28, 8, 1, 1, 8, 28, 56, 70, 56, 28, 8, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,8
|
|
COMMENTS
|
Eigensequence of the triangle = A051163: (1, 2, 5, 12, 30, 76,...)
Triangle, with zeros omitted, given by (1, 0, -1, 0, 0, 0, 0, 0, 0, 0, ...) DELTA (0, 1, -1, 0, 0, 0, 0, 0, 0, 0, ...) where DELTA is the operator defined in A084938. - Philippe Deléham, Jan 16 2012
|
|
LINKS
|
|
|
FORMULA
|
Triangle read by rows, Pascal's triangle rows repeated.
Equals inverse binomial transform of A133156 unsigned.
Sum_{k, 0<=k<=n} T(n,k)*x^k = A057077(n), A019590(n+1), A000012(n), A016116(n), A108411(n), A074872(n+1) for x = -2, -1, 0, 1, 2, 4 respectively. - Philippe Deléham, Jan 16 2012
|
|
EXAMPLE
|
The triangle starts
1;
1;
1, 1;
1, 1;
1, 2, 1;
1, 2, 1;
1, 3, 3, 1;
1, 3, 3, 1;
1, 4, 6, 4, 1;
1, 4, 6, 4, 1;
1, 5, 10, 10, 5, 1;
1, 5, 10, 10, 5, 1;
...
Triangle (1,0,-1,0,0,...) DELTA (0,1,-1,0,0,...) begins:
1
1, 0
1, 1, 0
1, 1, 0, 0
1, 2, 1, 0, 0
1, 2, 1, 0, 0, 0
1, 3, 3, 1, 0, 0, 0
1, 3, 3, 1, 0, 0, 0, 0
1, 4, 6, 4, 1, 0, 0, 0, 0
1, 4, 6, 4, 1, 0, 0, 0, 0, 0
1, 5, 10, 10, 5, 1, 0, 0, 0, 0, 0...
|
|
MATHEMATICA
|
t[n_, k_] := Binomial[ Floor[n/2], k]; Table[t[n, k], {n, 0, 17}, {k, 0, Floor[n/2]}] // Flatten (* Jean-François Alcover, Sep 13 2012 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|