|
Search: id:A107430
|
|
|
| A107430 |
|
Triangle read by rows: row n is row n of Pascal's triangle (A007318) sorted into increasing order. |
|
+0
7
|
|
| 1, 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 4, 6, 1, 1, 5, 5, 10, 10, 1, 1, 6, 6, 15, 15, 20, 1, 1, 7, 7, 21, 21, 35, 35, 1, 1, 8, 8, 28, 28, 56, 56, 70, 1, 1, 9, 9, 36, 36, 84, 84, 126, 126, 1, 1, 10, 10, 45, 45, 120, 120, 210, 210, 252, 1, 1, 11, 11, 55, 55, 165, 165, 330, 330, 462, 462, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,6
|
|
|
FORMULA
|
T(n,k) = C(n,floor(k/2)). - Paul Barry (pbarry(AT)wit.ie), Dec 15 2006; corrected by Philippe DELEHAM, Mar 15 2007
Sum_{k, 0<=k<=n}T(n,k)*x^(n-k) = A127363(n), A127362(n), A127361(n), A126869(n), A001405(n), A000079(n), A127358(n), A127359(n), A127360(n)for n=-4,-3,-2,-1,0,1,2,3,4 respectively . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 29 2007
|
|
EXAMPLE
|
Triangle begins:
1;
1,1;
1,1,2;
1,1,3,3;
1,1,4,4,6;
|
|
MAPLE
|
for n from 0 to 10 do sort([seq(binomial(n, k), k=0..n)]) od; # yields sequence in triangular form (Deustch)
|
|
MATHEMATICA
|
Flatten[ Table[ Sort[ Table[ Binomial[n, k], {k, 0, n}]], {n, 0, 12}]] (from Robert G. Wilson v (rgwv(AT)rgwv.com), May 28 2005)
|
|
CROSSREFS
|
A061554 is similar but with rows sorted into decreasing order.
Cf. A034868.
Adjacent sequences: A107427 A107428 A107429 this_sequence A107431 A107432 A107433
Sequence in context: A049695 A096589 A099573 this_sequence A132892 A077028 A114225
|
|
KEYWORD
|
nonn,tabl,easy
|
|
AUTHOR
|
Philippe DELEHAM, May 21 2005
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu) and Robert G. Wilson v (rgwv(AT)rgwv.com), May 28 2005
|
|
|
Search completed in 0.002 seconds
|
