Search Results for ""

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 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 figurate number constructed by taking the (3n-2)th tetrahedral number and removing the (n-1)th tetrahedral number from each of the four corners, Ttet_n = ...

Let L denote the n×n triangular lattice with wraparound. Call an orientation of L an assignment of a direction to each edge of L, and denote the number of orientations of L ...

By way of analogy with the eban numbers, uban numbers are defined as numbers whose English names do not contain the letter "u" (i.e., "u" is banned). Note that this ...

Let G be Gauss's constant and M=1/G be its multiplicative inverse. Then M/sqrt(2)=0.8472130... (OEIS A097057) is sometimes known as the ubiquitous constant (Spanier and ...

Let P_i=x_i:y_i:z_i be trilinear points for i=1, 2, 3. The A-vertex of the unary cofactor triangle is then defined as the point y_2z_3-z_2y_3:z_2x_3-x_2z_3:x_2y_3-y_2x_3, and ...

An unhappy number is a number that is not happy, i.e., a number n such that iterating this sum-of-squared-digits map starting with n never reaches the number 1. The first few ...

An n-uniform tessellation is a tessellation than has n transitivity classes of vertices. The 1-uniform tessellations are sometimes known as Archimedean tessellations. The ...