(self, n)
return _af_new(_af_pow(self.array_form, n))
Routine for finding powers of a permutation.

        Examples
        ========

        >>> from sympy.combinatorics.permutations import Permutation
        >>> Permutation.print_cyclic = False
        >>> p = Permutation([2,0,3,1])
        >>> p.order()
        4
        >>> p**4
        Permutation([0, 1, 2, 3])
Routine for finding powers of a permutation.
Routine for finding powers of a permutation .
def __pow__(self, n):
        """
        Routine for finding powers of a permutation.

        Examples
        ========

        >>> from sympy.combinatorics.permutations import Permutation
        >>> Permutation.print_cyclic = False
        >>> p = Permutation([2,0,3,1])
        >>> p.order()
        4
        >>> p**4
        Permutation([0, 1, 2, 3])
        """
        if type(n) == Perm:
            raise NotImplementedError(
                'p**p is not defined; do you mean p^p (conjugate)?')
        n = int(n)
        return _af_new(_af_pow(self.array_form, n))
def __pow__ ( self , n ) : if type ( n ) == Perm : raise NotImplementedError ( 'p**p is not defined; do you mean p^p (conjugate)?' ) n = int ( n ) return _af_new ( _af_pow ( self . array_form , n ) )