Search Results for ""
161 - 170 of 1366 for fibonacci seriesSearch Results
The Pell polynomials P(x) are the W-polynomials generated by the Lucas polynomial sequence using the generator p(x)=2x, q(x)=1. This gives recursive equations for P(x) from ...
Guy's "strong law of small numbers" states that there aren't enough small numbers to meet the many demands made of them. Guy (1988) also gives several interesting and ...
A stack polyomino is a self-avoiding convex polyomino containing two adjacent corners of its minimal bounding rectangle. The number of stack polyominoes with perimeter 2n+4 ...
The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...
A set of positive integers is double-free if, for any integer x, the set {x,2x} !subset= S (or equivalently, x in S implies 2x not in S). For example, of the subsets of ...
The Pell-Lucas numbers are the V_ns in the Lucas sequence with P=2 and Q=-1, and correspond to the Pell-Lucas polynomial Q_n(1). The Pell-Lucas number Q_n is equal to ...
The logarithmic spiral is a spiral whose polar equation is given by r=ae^(btheta), (1) where r is the distance from the origin, theta is the angle from the x-axis, and a and ...
A number is squareful, also called nonsquarefree, if it contains at least one square in its prime factorization. The first few are 4, 8, 9, 12, 16, 18, 20, 24, 25, ... (OEIS ...
A sequence which arises in the hypothetical reproduction of a population of rabbits. Let the substitution system map 0->1 correspond to young rabbits growing old, and 1->10 ...
Predictability at a time tau in the future is defined by (R(x(t),x(t+tau)))/(H(x(t))), and linear predictability by (L(x(t),x(t+tau)))/(H(x(t))), where R and L are the ...
...
View search results from all Wolfram sites (26993 matches)

