|
Search: id:A108958
|
|
|
| A108958 |
|
Number of unordered pairs of distinct length-n binary words having the same number of 1's. |
|
+0
2
|
|
| 0, 1, 6, 27, 110, 430, 1652, 6307, 24054, 91866, 351692, 1350030, 5196204, 20050108, 77542376, 300507427, 1166737574, 4537436578, 17672369756, 68922740122
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Equals row sums of triangle A143418, starting with a(2). [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 14 2008]
|
|
FORMULA
|
a(n) = sum(binomial(binomial(n, k), 2), k=0..n);
a(n) = binomial(2*n-1, n-1)-2^(n-1) = A088218(n)-A011782(n). E.g.f.: exp(2*x)*(BesselI(0, 2*x)-1)/2. - Vladeta Jovovic (vladeta(AT)eunet.rs), Jul 24 2005
a(n)=(1/2)*sum(i+j>n,0<=i,j<=n,binomial(i+j,i)) - Benoit Cloitre (benoit7848c(AT)orange.fr), May 26 2006
|
|
EXAMPLE
|
a(3) = 6 because the pairs are {001,010}, {001,100}, {010,100},
{011,101}, {011,110}, {101,110}
|
|
MAPLE
|
with(combinat) a := proc(n) sum(binomial(binomial(n, k), 2), k=0..n) end;
|
|
CROSSREFS
|
A143418 [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Aug 14 2008]
Sequence in context: A022634 A094788 A003517 this_sequence A005284 A014825 A141844
Adjacent sequences: A108955 A108956 A108957 this_sequence A108959 A108960 A108961
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Jeffrey Shallit (shallit(AT)graceland.uwaterloo.ca), Jul 22 2005
|
|
|
Search completed in 0.002 seconds
|
