Search Results for ""
1271 - 1280 of 3872 for Numbered Equation 43Search Results
Let a sequence {a_i}_(i=1)^infty be strictly increasing and composed of nonnegative integers. Call A(x) the number of terms not exceeding x. Then the density is given by ...
The position of a rational number in the sequence 1/1, 1/2, 2/1, 1/3, 3/1, 1/4, 2/3, 3/2, 4/1, 1/5, ..., ordered in terms of increasing numerator+denominator.
A set function is a function whose domain is a collection of sets. In many instances in real analysis, a set function is a function which associates an affinely extended real ...
Let v(G) be the number of vertices in a graph G and h(G) the length of the maximum cycle in G. Then the shortness exponent of a class of graphs G is defined by sigma(G)=lim ...
An even number of the form 4n+2 (i.e., an integer which is divisible by 2 but not by 4). The first few for n=0, 1, 2, ... are 2, 6, 10, 14, 18, ... (OEIS A016825)
A 3-multiperfect number P_3. Six sous-doubles are known (120, 672, 523776, 459818240, 1476304896, and 51001180160; OEIS A005820), and these are believed to comprise all ...
A 4-multiperfect number P_4. 36 sous-triples are known (30240, 32760, 2178540, 23569920, ...; OEIS A027687), and these are believed to comprise all sous-triples.
A spectrum sequence is a sequence formed by successive multiples of a real number a rounded down to the nearest integer s_n=|_na_|. If a is irrational, the spectrum is called ...
A Poulet number whose divisors d all satisfy d|2^d-2. The first few are 341, 1387, 2047, 2701, 3277, 4033, 4369, 4681, 5461, 7957, 8321, ... (OEIS A050217).
A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...
...
View search results from all Wolfram sites (43934 matches)

