TOPICS
Search

Search Results for ""


331 - 340 of 1618 for Lucas SequenceSearch Results
A quadratic recurrence is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a second-degree polynomial in x_k with k<n. For example, x_n=x_(n-1)x_(n-2) ...
Quasirandom numbers are numbers selected from a quasirandom sequence. Such numbers are useful in computational problems such as quasi-Monte Carlo integration.
The bias of a series is defined as Q[a_i,a_(i+1),a_(i+2)]=(a_ia_(i+2)-a_(i+1)^2)/(a_ia_(i+1)a_(i+2)). A series is geometric iff Q=0. A series is artistic iff the bias is ...
Sociable numbers are numbers that result in a periodic aliquot sequence, where an aliquot sequence is the sequence of numbers obtained by repeatedly applying the restricted ...
A subsequence of {a} is a sequence {b} defined by b_k=a_(n_k), where n_1<n_2<... is an increasing sequence of indices (D'Angelo and West 2000). For example, the prime numbers ...
The exact values of cos(pi/18) and sin(pi/18) can be given by infinite nested radicals sin(pi/(18))=1/2sqrt(2-sqrt(2+sqrt(2+sqrt(2-...)))), where the sequence of signs +, +, ...
A polynomial is called unimodal if the sequence of its coefficients is unimodal. If P(x) is log-convex and Q(x) is unimodal, then P(x)Q(x) is unimodal.
The upper-trimmed subsequence of x={x_n} is the sequence lambda(x) obtained by dropping the first occurrence of n for each n. If x is a fractal sequence, then lambda(x)=x.
A Calkin-Wilf tree is a special type of binary tree obtained by starting with the fraction 1/1 and iteratively adding a/(a+b) and (a+b)/b below each fraction a/b. The ...
The constant lambda=1.303577269034296... (OEIS A014715) giving the asymptotic rate of growth Clambda^n of the number of digits in the nth term of the look and say sequence, ...
1 ... 31|32|33|34|35|36|37 ... 162 Previous Next

...