FindSequenceFunction[{a_1, a_2, a_3, ...}] attempts to find a simple function that yields the sequence a_n when given successive integer arguments.FindSequenceFunction[{{n_1, ...

Floor[x] gives the greatest integer less than or equal to x. Floor[x, a] gives the greatest multiple of a less than or equal to x.

GatherBy[list, f] gathers into sublists each set of elements in list that gives the same value when f is applied.GatherBy[list, {f_1, f_2, ...}] gathers list into nested ...

x >= y or x >= y yields True if x is determined to be greater than or equal to y. x_1 >= x_2 >= x_3 yields True if the x_i form a non-increasing sequence.

x > y yields True if x is determined to be greater than y. x_1 > x_2 > x_3 yields True if the x_i form a strictly decreasing sequence.

GroupOrbits[group, {p_1, ...}] returns the orbits of the points p_i under the action of the elements of group.GroupOrbits[group, {p_1, ...}, f] finds the orbits under the ...

Im[z] gives the imaginary part of the complex number z.

IntegerPartitions[n] gives a list of all possible ways to partition the integer n into smaller integers. IntegerPartitions[n, k] gives partitions into at most k integers. ...

KroneckerProduct[m_1, m_2, ...] constructs the Kronecker product of the arrays m_i.

x <= y or x <= y yields True if x is determined to be less than or equal to y. x_1 <= x_2 <= x_3 yields True if the x TraditionalForm\`i form a nondecreasing sequence.