diff --git a/src/sage/categories/examples/finite_semigroups.py b/src/sage/categories/examples/finite_semigroups.py
index 714b39c86f9..76912828a9b 100644
--- a/src/sage/categories/examples/finite_semigroups.py
+++ b/src/sage/categories/examples/finite_semigroups.py
@@ -116,7 +116,7 @@ def __init__(self, alphabet=('a','b','c','d'), category=None):
         self.alphabet = alphabet
         if category is None:
             category = Semigroups().Finite().FinitelyGenerated())
-        Parent.__init__(self, category = category)
+        Parent.__init__(self, category=category)
 
     def _repr_(self):
         r"""
diff --git a/src/sage/combinat/j_trivial_monoids.py b/src/sage/combinat/j_trivial_monoids.py
index 1314d73cf5a..53c1e1601b7 100644
--- a/src/sage/combinat/j_trivial_monoids.py
+++ b/src/sage/combinat/j_trivial_monoids.py
@@ -71,8 +71,10 @@ def semigroup_generators(self):
         Return the generating family of the monoid ``self``, namely all
         unitriangular boolean matrices with n+1 1s
 
-        TODO:: Make immutable matrices in an easier way... This method should
-        be only one line.
+        .. TODO::
+
+            Make immutable matrices in an easier way... This method should
+            be only one line.
 
         EXAMPLES::
 
@@ -99,7 +101,7 @@ def cardinality(self):
             sage: UnitriangularBooleanMatrices(6).cardinality()
             32768
         """
-        return 2**((self.n**2-self.n)//2)
+        return 2 ** ((self.n ** 2 - self.n) // 2)
 
     def _an_element_(self):
         """