Search Results for ""

One of a set of numbers defined in terms of an invariant generated by the finite cyclic covering spaces of a knot complement. The torsion numbers for knots up to 9 crossings ...

An integer is k-smooth if it has no prime factors >k. The following table gives the first few k-smooth numbers for small k. Berndt (1994, p. 52) called the 7-smooth numbers ...

The numbers B_(n,k)(1!,2!,3!,...)=(n-1; k-1)(n!)/(k!), where B_(n,k) is a Bell polynomial.

Guy's "strong law of small numbers" states that there aren't enough small numbers to meet the many demands made of them. Guy (1988) also gives several interesting and ...

Let the sum of the squares of the digits of a positive integer s_0 be represented by s_1. In a similar way, let the sum of the squares of the digits of s_1 be represented by ...

The Markov numbers m are the union of the solutions (x,y,z) to the Markov equation x^2+y^2+z^2=3xyz, (1) and are related to Lagrange numbers L_n by L_n=sqrt(9-4/(m^2)). (2) ...

The idempotent numbers are given by B_(n,k)(1,2,3,...)=(n; k)k^(n-k), where B_(n,k) is a Bell polynomial and (n; k) is a binomial coefficient. A table of the first few is ...

Given a Euclidean n-space, H_n=n+1.

Let G be a finite graph and v a vertex of G. The stabilizer of v, stab(v), is the set of group elements {g in Aut(G)|g(v)=v}, where Aut(g) is the graph automorphism group. ...

The numbers lambda_(nun) in the Gaussian quadrature formula Q_n(f)=sum_(nu=1)^nlambda_(nun)f(x_(nun)).