|
Search: id:A115246
|
|
|
| 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. |
|
+0
4
|
|
| 0, 0, 27, 288, 2250, 15795, 105987, 696864, 4540968, 29490750, 191420427, 1243565235, 8091223647, 52739879283, 344402073027, 2253045672480, 14764068268068, 96899123172708, 636877933530303, 4191430966219038
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
