|
Search: id:A096957
|
|
| |
|
| 6, 19, 40, 70, 110, 161, 224, 300, 390, 495, 616, 754, 910, 1085, 1280, 1496, 1734, 1995, 2280, 2590, 2926, 3289, 3680, 4100, 4550, 5031, 5544, 6090, 6670, 7285, 7936, 8624, 9350, 10115, 10920, 11766, 12654, 13585, 14560, 15580, 16646, 17759, 18920
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
If Y is a 6-subset of an n-set X then, for n>=8, a(n-8) is the number of 3-subsets of X having at most one element in common with Y. - Milan R. Janjic (agnus(AT)blic.net), Dec 16 2007
|
|
FORMULA
|
a(n)= A096956(n+3, 3) = 6*b(n) - 5*b(n-1) = (n+18)*binomial(n+2, 2)/3, with b(n):=A000292(n)=binomial(n+3, 3).
G.f.: (6-5*x)/(1-x)^4.
|
|
CROSSREFS
|
Cf. A056115 (third column), A096958 (fifth column).
Sequence in context: A090381 A106398 A054567 this_sequence A035495 A061293 A005900
Adjacent sequences: A096954 A096955 A096956 this_sequence A096958 A096959 A096960
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Wolfdieter Lang (wolfdieter.lang_AT_physik_DOT_uni-karlsruhe_DOT_de), Aug 13 2004
|
|
|
Search completed in 0.002 seconds
|
