1,1

There is the following general formula: The number T(n,k,r) of n-tuples where each entry is chosen from the subsets of {1,2,..,k} such that the intersection of all n entries contains exactly r elements is: T(n,k,r) = C(k,r) * (2^n - 1)^(k-r). This may be shown by exhibiting a bijection to a set whose cardinality is obviously C(k,r) * (2^n - 1)^(k-r), namely the set of all k-tuples where each entry is chosen from subsets of {1,..,n} in the following way: Exactly r entries must be {1,..,n} itself (there are C(k,r) ways to choose them) and the remaining (k-r) entries must be chosen from the 2^n-1 proper subsets of {1,..,n}, i.e. for each of the (k-r) entries, {1,..,n} is forbidden (there are, independent of the choice of the full entries, (2^n - 1)^(k-r) possibilities to do that, hence the formula). The bijection into this set is given by (X_1,..,X_n) |-> (Y_1,..,Y_k) where for each j in {1,..,k} and each i in {1,..,n}, i is in Y_j if and only if j is in X_i.

a(n)=5 * (2^n-1)^4

a(1)=5 because the five tuples of length one are ({1}),({2}),({3}),({4}),({5}).

In Java: import java.io.*; import java.math.*; public class MakeSequence { public static void main(String[] args) { String s = new String(); BigInteger x; BigInteger one = new BigInteger("1"); BigInteger five = new BigInteger("5"); String help; try { BufferedWriter out = new BufferedWriter(new FileWriter("sequence.txt")); for (Integer k=1; k<31; ++k) { x = (((two.pow(k)).subtract(one)).pow(4)).multiply(five); help = x.toString(); s = help + ", "; out.write(s); } out.close(); } catch (IOException e) { } } }

Sequence in context: A057633 A006700 A079011 this_sequence A075769 A046274 A147684

Adjacent sequences: A128863 A128864 A128865 this_sequence A128867 A128868 A128869

nonn

Peter C. Heinig (heinig(AT)in.tum.de), Apr 17 2007