|
|
A006987
|
|
Binomial coefficients: C(n,k), 2 <= k <= n-2, sorted, duplicates removed.
(Formerly M4084)
|
|
27
|
|
|
6, 10, 15, 20, 21, 28, 35, 36, 45, 55, 56, 66, 70, 78, 84, 91, 105, 120, 126, 136, 153, 165, 171, 190, 210, 220, 231, 252, 253, 276, 286, 300, 325, 330, 351, 364, 378, 406, 435, 455, 462, 465, 495, 496, 528, 560, 561, 595, 630, 666, 680, 703, 715, 741, 780, 792, 816, 820
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Or numbers l which, for the first time, appear in m-th row of the Pascal triangle for m < l. - Vladimir Shevelev, Apr 28 2010
Appears to be the set of simplex numbers of order > 2 and dimension > 1. - Dylan Hamilton, Nov 05 2010
This is correct (assuming the notational choice of giving the first n-simplicial number index 1), as the n-th diagonal or antidiagonal of Pascal's triangle gives the n-simplicial numbers. - Thomas Anton, Dec 04 2018
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
EXAMPLE
|
Pascal's triangle (A007318) with the outer two layers removed:
6
10 10
15 20 15
21 35 35 21
28 56 70 56 28
36 84 126 126 84 36
...
|
|
MATHEMATICA
|
Take[ Union[ Flatten[ Table[ Binomial[n, k], {n, 2, 45}, {k, 2, n - 2}]]], 58] (* Robert G. Wilson v, May 25 2004 *)
|
|
PROG
|
(PARI) list(lim)=my(v=List(), t); for(n=4, sqrtint(2*lim)+1, for(k=2, n\2, t=binomial(n, k); if(t>lim, break, listput(v, t)))); vecsort(Vec(v), , 8) \\ Charles R Greathouse IV, Apr 03 2012
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|