Search Results for ""

The thinnest sequence which contains 1, and whenever it contains x, also contains 2x, 3x+2, and 6x+3: 1, 2, 4, 5, 8, 9, 10, 14, 15, 16, 17, ... (OEIS A005658).

The partial differential equation (u_t)/(u_x)=1/4(u_(xxx))/(u_x)-3/8(u_(xx)^2)/(u_x^2)+3/2(p(u))/(u_x^2), where p(u)=1/4(4u^3-g_2u-g_3). The special cases ...

The recurrence relation (n-1)A_(n+1)=(n^2-1)A_n+(n+1)A_(n-1)+4(-1)^n valid for n=4, 5, ... with A(2)=0 and A(3)=1 and which solves the married couples problem (Dörrie 1965, ...

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

As Gauss showed in 1812, the hyperbolic tangent can be written using a continued fraction as tanhx=x/(1+(x^2)/(3+(x^2)/(5+...))) (Wall 1948, p. 349; Olds 1963, p. 138).

The Lyons group is the sporadic group Ly of order |Ly| = 51765179004000000 (1) = 2^8·3^7·5^6·7·11·31·37·67. (2) It is implemented in the Wolfram Language as LyonsGroupLy[].

The Maclaurin-Bézout theorem says that two curves of degree n intersect in n^2 points, so two cubics intersect in nine points. This means that n(n+3)/2 points do not always ...

If a_1, a_2, a_3, ... is an artistic sequence, then 1/a_1, 1/a_2, 1/a_3, ... is a melodic sequence. The recurrence relation obeyed by melodic series is ...

A graph G is called d-polytopal if there exists a d-dimensional convex polytope P such that the vertices and edges of G are in a one-to-one incidence-preserving ...

The projective special linear group PSL_n(q) is the group obtained from the special linear group SL_n(q) on factoring by the scalar matrices contained in that group. It is ...