Number of different ways to select n elements from three sets of n elements such that there is at least one element from each set.

A115246

Number of different ways to select n elements from three sets of n elements such that there is at least one element from each set.

Terms

    a(0) =0a(1) =0a(2) =27a(3) =288a(4) =2250a(5) =15795a(6) =105987a(7) =696864a(8) =4540968a(9) =29490750a(10) =191420427a(11) =1243565235a(12) =8091223647a(13) =52739879283a(14) =344402073027

External references