|
Search: id:A089886
|
|
|
| A089886 |
|
T(n,k) = number of subsets of {1,..., n} containing exactly k squares, triangle read by rows, 0<=k<n. |
|
+0
5
|
|
| 1, 2, 2, 4, 4, 0, 4, 8, 4, 0, 8, 16, 8, 0, 0, 16, 32, 16, 0, 0, 0, 32, 64, 32, 0, 0, 0, 0, 64, 128, 64, 0, 0, 0, 0, 0, 64, 192, 192, 64, 0, 0, 0, 0, 0, 128, 384, 384, 128, 0, 0, 0, 0, 0, 0, 256, 768, 768, 256, 0, 0, 0, 0, 0, 0, 0, 512, 1536, 1536, 512, 0, 0, 0, 0, 0, 0, 0, 0, 1024
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
T(n,k)=T(n, A000196(n)-k) for 0<=k<=A000196(n);
T(n,k)=0 iff k > A000196(n);
A089887(n)=T(n,0); A089889(n)=T(n,1) for n>1; A089890(n)=T(n,2) for n>2;
A089888(n) = Sum(T(n,k): 1<=k<=A000196(n));
T(n,k) = A007318(A000196(n),k)*A000079(n-A000196(n)).
|
|
FORMULA
|
T(n, k) = binomial(floor(n^(1/2)), k)*2^(n-floor(n^(1/2))).
|
|
CROSSREFS
|
Cf. A000290.
Sequence in context: A019681 A054529 A074934 this_sequence A071511 A119922 A097860
Adjacent sequences: A089883 A089884 A089885 this_sequence A089887 A089888 A089889
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Nov 13 2003
|
|
|
Search completed in 0.002 seconds
|
