If you represent the n^th term in a sequence as a[n], you can use a recurrence equation to specify how it is related to other terms in the sequence. RSolve takes recurrence ...
JacobiCN[u, m] gives the Jacobi elliptic function cn(u | m).
Property[item, name -> value] associates the property name -> value with item.
Cyclotomic[n, x] gives the n\[Null]^th cyclotomic polynomial in x.
Discriminant[poly, var] computes the discriminant of the polynomial poly with respect to the variable var.Discriminant[poly, var, Modulus -> p] computes the discriminant ...
RandomChoice[{e_1, e_2, ...}] gives a pseudorandom choice of one of the e_i. RandomChoice[list, n] gives a list of n pseudorandom choices. RandomChoice[list, {n_1, n_2, ...}] ...
StandardDeviation[list] gives the sample standard deviation of the elements in list. StandardDeviation[dist] gives the standard deviation of the symbolic distribution dist.
LindleyDistribution[\[Delta]] represents a Lindley distribution with shape parameter \[Delta].
JacobiND[u, m] gives the Jacobi elliptic function nd(u | m).