Search Results for ""

The total power of a triangle is defined by P=1/2(a_1^2+a_2^2+a_3^2), (1) where a_i are the side lengths, and the "partial power" is defined by p_1=1/2(a_2^2+a_3^2-a_1^2). ...

A triangle tiling is a tiling of the plane by identical triangles. Any triangle tiles the plane (Wells 1991, p. 208). The total number of triangles (including inverted ones) ...

The tribonacci constant is ratio to which adjacent tribonacci numbers tend, and is given by t = (x^3-x^2-x-1)_1 (1) = 1/3(1+RadicalBox[{19, -, 3, {sqrt(, 33, )}}, ...

A number n such that the last digits of n^3 are the same as n. 49 is trimorphic since 49^3=117649 (Wells 1986, p. 124). The first few are 1, 4, 5, 6, 9, 24, 25, 49, 51, 75, ...

The trinomial triangle is a number triangle of trinomial coefficients. It can be obtained by starting with a row containing a single "1" and the next row containing three 1s ...

A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...

The tritetrahedral graph is the skeleton of the tritetrahedron, a concave polyhedron formed by joining three regular tetrahedra at their faces. The Nechushtan graph, a ...

A number of the form Tt_n=((n+2; 2); 2)=1/8n(n+1)(n+2)(n+3) (Comtet 1974, Stanley 1999), where (n; k) is a binomial coefficient. The first few values are 3, 15, 45, 105, 210, ...

A trivalent tree, also called a 3-valent tree or a 3-Cayley tree, is a tree for which each node has vertex degree <=3. The numbers of trivalent trees on n=1, 2, ... nodes are ...

A Trott constant is a real number whose decimal digits are equal to the terms of its continued fraction. The first Trott constant (OEIS A039662) was discovered by M. Trott in ...