Search Results for ""
1321 - 1330 of 1537 for sequenceSearch Results
An e-prime is a prime number appearing in the decimal expansion of e. The first few are 2, 271, 2718281, ...
The simple continued fraction representations of e given by [2; 1, 2, 1, 1, 4, 1, 1, 6, ...] (OEIS A003417). This continued fraction is sometimes known as Euler's continued ...
One form of van der Waerden's theorem states that for all positive integers k and r, there exists a constant n(r,k) such that if n_0>=n(r,k) and {1,2,...,n_0} subset C_1 ...
Let p be a prime with n digits and let A be a constant. Call p an "A-prime" if the concatenation of the first n digits of A (ignoring the decimal point if one is present) ...
Given a group of n men arranged in a circle under the edict that every mth man will be executed going around the circle until only one remains, find the position L(n,m) in ...
A number is said to be simply normal to base b if its base-b expansion has each digit appearing with average frequency tending to b^(-1). A normal number is an irrational ...
Pascal's triangle is a number triangle with numbers arranged in staggered rows such that a_(nr)=(n!)/(r!(n-r)!)=(n; r), (1) where (n; r) is a binomial coefficient. The ...
The simple continued fraction for pi is given by [3; 7, 15, 1, 292, 1, 1, 1, 2, 1, 3, 1, 14, 2, 1, 1, 2, 2, 2, 2, ...] (OEIS A001203). A plot of the first 256 terms of the ...
The power tower of order k is defined as a^^k=a^(a^(·^(·^(·^a))))_()_(k), (1) where ^ is Knuth up-arrow notation (Knuth 1976), which in turn is defined by ...
There exist a variety of formulas for either producing the nth prime as a function of n or taking on only prime values. However, all such formulas require either extremely ...
...
View search results from all Wolfram sites (10957 matches)

