DirichletConvolve[f, g, n, m] gives the Dirichlet convolution of the expressions f and g.
FindClique[g] finds a clique with maximum number of vertices in the graph g.
FindDivisions[{x_min, x_max}, n] finds a list of about n "nice" numbers that divide the interval around x_min to x_max into equally spaced parts. FindDivisions[{x_min, x_max, ...
FindLinearRecurrence[list] finds if possible the minimal linear recurrence that generates list.FindLinearRecurrence[list, d] finds if possible the linear recurrence of ...
FindPermutation[expr] gives a permutation that produces expr by permuting Sort[expr].FindPermutation[expr 1, expr 2] gives a permutation that converts expr_1 to expr_2 for ...
FiniteGroupCount[n] gives the number of finite groups of order n.
GroupCentralizer[group, g] returns the centralizer of the element g in group.
Haversine[z] gives the haversine function hav(z).
HeavisidePi[x] represents the box distribution \[CapitalPi](x), equal to 1 for |x| < 1/2 and 0 for |x| > 1/2.HeavisidePi[x_1, x_2, ...] represents the multidimensional box ...
Hyperfactorial[n] gives the hyperfactorial function H(n).