|
Search: id:A131115
|
|
|
| A131115 |
|
Triangle read by rows: T(n,k)=7*binom(n,k) if k<n; T(n,n)=1 (0<=k<=n). |
|
+0
6
|
|
| 1, 7, 1, 7, 14, 1, 7, 21, 21, 1, 7, 28, 42, 28, 1, 7, 35, 70, 70, 35, 1, 7, 42, 105, 140, 105, 42, 1, 7, 49, 147, 245, 245, 147, 49, 1, 7, 56, 196, 392, 490, 392, 196, 56, 1, 7, 63, 252, 588, 882, 882, 588, 252, 63, 1, 7, 70, 315, 840, 1470, 1764, 1470, 840, 315, 70, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Row sums = A048489: (1, 8, 22, 50, 106, 218,...)
Non-diagonal entries of Pascal's triangle are multiplied by 7. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2007
|
|
FORMULA
|
G.f.=G(t,z)=(1+6z-tz)/[(1-tz)(1-z-tz)]. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2007
|
|
EXAMPLE
|
First few rows of the triangle are:
1;
7, 1;
7, 14, 1;
7, 21, 21, 1;
7, 28, 42, 28, 1;
7, 35, 70, 70, 35, 1;
...
|
|
MAPLE
|
T := proc (n, k) if k < n then 7*binomial(n, k) elif k = n then 1 else 0 end if end proc; for n from 0 to 10 do seq(T(n, k), k = 0 .. n) end do; # yields sequence in triangular form - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2007
|
|
CROSSREFS
|
Cf. A131110, A131111, A131112, A131113, A131114, A048489, A007318.
Sequence in context: A010772 A093564 A081776 this_sequence A138616 A021937 A021586
Adjacent sequences: A131112 A131113 A131114 this_sequence A131116 A131117 A131118
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Gary W. Adamson (qntmpkt(AT)yahoo.com), Jun 15 2007
|
|
EXTENSIONS
|
Corrected and extended by Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 20 2007
|
|
|
Search completed in 0.002 seconds
|
