Search Results for ""

The sequence obtained from reversing the digits of a number n and adding the result to the original number. For n=1, 2, ..., this gives 2, 4, 6, 8, 10, 12, 14, 16, 18, 11, ...

A figurate number which is constructed as a centered cube with a square pyramid appended to each face, RhoDod_n = CCub_n+6P_(n-1)^((4)) (1) = (2n-1)(2n^2-2n+1), (2) where ...

The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...

The operator of fractional integration is defined as _aD_t^(-nu)f(t)=1/(Gamma(nu))int_a^tf(u)(t-u)^(nu-1)du for nu>0 with _aD_t^0f(t)=f(t) (Oldham and Spanier 1974, Miller ...

The differential equation where alpha+alpha^'+beta+beta^'+gamma+gamma^'=1, first obtained in the form by Papperitz (1885; Barnes 1908). Solutions are Riemann P-series ...

By a suitable rearrangement of terms, a conditionally convergent series may be made to converge to any desired value, or to diverge. For example, S = 1-1/2+1/3-1/4+1/5+... ...

The rule which determines the orientation of the cross product u×v. The right-hand rule states that the orientation of the vectors' cross product is determined by placing u ...

A circle packing is called rigid (or "stable") if every circle is fixed by its neighbors, i.e., no circle can be translated without disturbing other circles of the packing ...

The Robertson-Seymour theorem, also called the graph minor theorem, is a generalization of the Kuratowski reduction theorem by Robertson and Seymour, which states that the ...

Robertson's apex graph is the 15-vertex graph illustrated above constructed by Neil Robertson as an example of an apex graph that is not YDeltaY-reducible. The graph may be ...