Search Results for ""

Consider the recurrence relation x_n=(1+x_0^2+x_1^2+...+x_(n-1)^2)/n, (1) with x_0=1. The first few iterates of x_n are 1, 2, 3, 5, 10, 28, 154, ... (OEIS A003504). The terms ...

The polynomials G_n(x;a,b) given by the associated Sheffer sequence with f(t)=e^(at)(e^(bt)-1), (1) where b!=0. The inverse function (and therefore generating function) ...

Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...

The Gram series is an approximation to the prime counting function given by G(x)=1+sum_(k=1)^infty((lnx)^k)/(kk!zeta(k+1)), (1) where zeta(z) is the Riemann zeta function ...

A shortest path between two graph vertices (u,v) of a graph (Skiena 1990, p. 225). There may be more than one different shortest paths, all of the same length. Graph ...

In general, a graph product of two graphs G and H is a new graph whose vertex set is V(G)×V(H) and where, for any two vertices (g,h) and (g^',h^') in the product, the ...

The graph tensor product, also called the graph cardinal product (Imrich 1998), graph categorical product, graph conjunction, graph direct product (Hammack et al. 2016), ...

A partition {a_1,...,a_n} is called graphical if there exists a graph G having degree sequence {a_1,...,a_n}. The number of graphical partitions of length n is equal to the ...

The great dirhombicosidodecahedron is the uniform polyhedron with Maeder index 75 (Maeder 1997), Wenninger index 119 (Wenninger 1989), Coxeter index 82 (Coxeter et al. 1954), ...

The great icosidodecahedron, not to be confused with the great icosahedron or great icosicosidodecahedron, is the uniform polyhedron with Maeder index 54 (Maeder 1997), ...