|
Search: id:A027660
|
|
|
| A027660 |
|
C(n+2,2)+C(n+2,3)+C(n+2,4)+C(n+2,5). |
|
+0
3
|
|
| 1, 4, 11, 26, 56, 112, 210, 372, 627, 1012, 1573, 2366, 3458, 4928, 6868, 9384, 12597, 16644, 21679, 27874, 35420, 44528, 55430, 68380, 83655, 101556, 122409, 146566, 174406, 206336, 242792
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Also, number of 135246-avoiding permutations of n+2 with exactly 1 descent. E.g. there are 57 permutations of 6 with exactly 1 descent. Of these, only the permutation 135246 contains the pattern 135246 so a(4)=56. - Mike Zabrocki (zabrocki(AT)mathstat.yorku.ca), Nov 29 2004
If Y is a 2-subset of an n-set X then, for n>=5, a(n-5) is the number of 5-subsets of X which have no exactly one element in common with Y. - Milan R. Janjic (agnus(AT)blic.net), Dec 28 2007
|
|
LINKS
|
Alexsandar Petojevic, The Function vM_m(s; a; z) and Some Well-Known Sequences, Journal of Integer Sequences, Vol. 5 (2002), Article 02.1.7
|
|
FORMULA
|
G.f.: (1-2x+2x^2)/(1-x)^6. - Mike Zabrocki (zabrocki(AT)mathstat.yorku.ca), Nov 29 2004
binomial(n,5)+binomial(n,3), n>=3. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 24 2006
|
|
MAPLE
|
(1/120)*(n+3)*(n+2)*(n+1)*(n^2-n+20);
[seq(binomial(n, 5)+binomial(n, 3), n=3..34)]; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 24 2006
seq(sum(binomial(n, k+1), k=1..4), n=2..32); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 14 2007
|
|
CROSSREFS
|
Cf. A000295.
Sequence in context: A076048 A109414 A027966 this_sequence A002940 A030196 A000295
Adjacent sequences: A027657 A027658 A027659 this_sequence A027661 A027662 A027663
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
