Clarify the table entries for combinatorics.
diff --git a/Doc/library/itertools.rst b/Doc/library/itertools.rst
index c0a1305..98c5216 100644
--- a/Doc/library/itertools.rst
+++ b/Doc/library/itertools.rst
@@ -65,13 +65,17 @@
**Combinatoric generators:**
- ===================================== ==================== =================================================
- Iterator Arguments Results
- ===================================== ==================== =================================================
- :func:`product` p, q, ... [repeat=1] cartesian product
- :func:`permutations` p[, r] r-length permutations (without repeated elements)
- :func:`combinations` p[, r] r-length combinations (sorted and no repeats)
- ===================================== ==================== =================================================
+ ============================================== ==================== =============================================================
+ Iterator Arguments Results
+ ============================================== ==================== =============================================================
+ :func:`product` p, q, ... [repeat=1] cartesian product, equivalent to a nested for-loop
+ :func:`permutations` p[, r] r-length tuples, all possible orderings, no repeated elements
+ :func:`combinations` p[, r] r-length tuples, in sorted order, no repeated elements
+ |
+ ``product('ABCD', repeat=2)`` ``AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD``
+ ``permutations('ABCD', 2)`` ``AB AC AD BA BC BD CA CB CD DA DB DC``
+ ``combinations('ABCD', 2)`` ``AB AC AD BC BD CD``
+ ============================================== ==================== =============================================================
.. _itertools-functions: