TOPICS
Search

Search Results for ""


641 - 650 of 1538 for Equidistributed sequenceSearch Results
Barban's constant is defined as C_(Barban) = product_(p)[1+(3p^2-1)/(p(p+1)(p^2-1))] (1) = 2.596536... (2) (OEIS A175640), where the product is over the primes p.
Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...
A Belphegor number (also known as a Beelphegor number or a beastly palindromic prime) is a palindromic number of the form 1(0...)666(0...)1. Numbers of this form are named ...
An equation for a lattice sum b_3(1) (Borwein and Bailey 2003, p. 26) b_3(1) = sum^'_(i,j,k=-infty)^infty((-1)^(i+j+k))/(sqrt(i^2+j^2+k^2)) (1) = ...
A benzenoid is a fusene that is a subgraph of the regular hexagonal lattice (i.e., a simply connected polyhex). The numbers of n-hexagon benzenoids for n=1, 2, ... are 1, 1, ...
11 21 3 41 4 7 81 5 11 15 161 6 16 26 31 32 (1) The number triangle illustrated above (OEIS A008949) composed of the partial sums of binomial coefficients, a_(nk) = ...
In order to find a root of a polynomial equation a_0x^n+a_1x^(n-1)+...+a_n=0, (1) consider the difference equation a_0y(t+n)+a_1y(t+n-1)+...+a_ny(t)=0, (2) which is known to ...
A tree (also called a bicentral tree) having two nodes that are graph centers. The numbers of bicentered trees on n=1, 2, ... nodes are 0, 1, 0, 1, 1, 3, 4, 11, 20, 51, 108 ...
A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...
The bifolium is a folium with b=0. The bifolium is a quartic curve and is given by the implicit equation is (x^2+y^2)^2=4axy^2 (1) and the polar equation ...
1 ... 62|63|64|65|66|67|68 ... 154 Previous Next

...