Search Results for ""
1291 - 1300 of 2350 for Eisenstein IntegerSearch Results
A standard normal distribution is a normal distribution with zero mean (mu=0) and unit variance (sigma^2=1), given by the probability density function and distribution ...
The Steenrod algebra has to do with the cohomology operations in singular cohomology with integer mod 2 coefficients. For every n in Z and i in {0,1,2,3,...} there are ...
For what value of x is f(x)=x^(1/x) a maximum? The maximum occurs at x=e, where f^'(x)=x^(-2+1/x)(1-lnx)=0, (1) which is zero at x=e and gives a maximum of ...
A figurate number of the form StOct_n = O_n+8Te_(n-1) (1) = n(2n^2-1), (2) where O_n is an octahedral number and Te_n is a tetrahedral number. The first few are 1, 14, 51, ...
Stern's diatomic series is the sequence 1, 1,2, 1,3,2,3, 1,4,3,5,2,5,3,4, (1) ... (OEIS A002487) which arises in the Calkin-Wilf tree. It is sometimes also known as the fusc ...
Polynomials S_k(x) which form the Sheffer sequence for g(t) = e^(-t) (1) f^(-1)(t) = ln(1/(1-e^(-t))), (2) where f^(-1)(t) is the inverse function of f(t), and have ...
Strang's strange figures are the figures produced by plotting a periodic function f(z) as a function of an integer argument n for n=1, 2, .... Unexpected patterns and ...
The first Strehl identity is the binomial sum identity sum_(k=0)^n(n; k)^3=sum_(k=0)^n(n; k)^2(2k; n), (Strehl 1993, 1994; Koepf 1998, p. 55), which are the so-called Franel ...
A strongly binary tree is a rooted tree for which the root is adjacent to either zero or two vertices, and all non-root vertices are adjacent to either one or three vertices ...
A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...
...
View search results from all Wolfram sites (336438 matches)

