|
Search: id:A095665
|
|
| |
|
| 3, 28, 145, 550, 1705, 4576, 11011, 24310, 50050, 97240, 179894, 319124, 545870, 904400, 1456730, 2288132, 3513917, 5287700, 7811375, 11347050, 16231215, 22891440, 31865925, 43826250, 59603700, 80219568, 106919868, 141214920
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
If Y is a 3-subset of an n-set X then, for n>=11, a(n-11) is the number of 9-subsets of X having at most one element in common with Y. - Milan R. Janjic (agnus(AT)blic.net), Nov 23 2007
|
|
FORMULA
|
a(n)= binomial(n+8, 8)*(n+27)/9 = 3*b(n)-2*b(n-1), with b(n):=binomial(n+9, 9); cf. A000582.
G.f.: (3-2*x)/(1-x)^10.
|
|
CROSSREFS
|
Ninth column: A095663.
Sequence in context: A100019 A053132 A048367 this_sequence A145346 A012762 A012778
Adjacent sequences: A095662 A095663 A095664 this_sequence A095666 A095667 A095668
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Jun 11 2004
|
|
|
Search completed in 0.002 seconds
|