TOPICS
Search

Search Results for ""


41 - 50 of 1873 for inline 11Search Results
A Barker code is a string of digits a_i=+/-1 of length l>=2 such that |sum_(i=1)^(l-k)a_ia_(i+k)|<=1 for all 1<=k<l. Barker codes are used for pulse compression of radar ...
The cuban primes, named after differences between successive cubic numbers, have the form n^3-(n-1)^3. The first few are 7, 19, 37, 61, 127, 271, ... (OEIS A002407), which ...
Given a 111×111 (0,1)-matrix, fill 11 spaces in each row in such a way that all columns also have 11 spaces filled. Furthermore, each pair of rows must have exactly one ...
A prime factor is a factor that is prime, i.e., one that cannot itself be factored. In general, a prime factorization takes the form ...
A prime constellation of four successive primes with minimal distance (p,p+2,p+6,p+8). The term was coined by Paul Stäckel (1892-1919; Tietze 1965, p. 19). The quadruplet (2, ...
A matrix whose elements may contain complex numbers. The matrix product of two 2×2 complex matrices is given by (1) where R_(11) = ...
y approx m+sigmaw, (1) where w = (2) where h_1(x) = 1/6He_2(x) (3) h_2(x) = 1/(24)He_3(x) (4) h_(11)(x) = -1/(36)[2He_3(x)+He_1(x)] (5) h_3(x) = 1/(120)He_4(x) (6) h_(12)(x) ...
Call a number of the form n^2-k a "near-square number." Numbers of the form n^2-5 for n=1, 2, ... are -4, -1, 4, 11, 20, 31, 44, 59, 76, 95, ... (OEIS A028875). These are ...
A number of graphs are associated with P. J. Owens. The 76-node Owens graph (Owens 1980) provides the smallest known example of a polyhedral quintic nonhamiltonian graph. It ...
Given two starting numbers (a_1,a_2), the following table gives the unique sequences {a_i} that contain no three-term arithmetic progressions. Sloane sequence A003278 1, 2, ...
1|2|3|4|5|6|7|8 ... 188 Previous Next

...