Search Results for ""
391 - 400 of 1609 for Lookand Say SequenceSearch Results
![](/common/images/search/spacer.gif)
Suppose that A is a Banach algebra and X is a Banach A-bimodule. For n=0, 1, 2, ..., let C^n(A,X) be the Banach space of all bounded n-linear mappings from A×...×A into X ...
The pair of sequences defined by F(0)=1, M(0)=0, and F(n) = n-M(F(n-1)) (1) M(n) = n-F(M(n-1)). (2) The first few terms of the "male" sequence M(n) for n=0, 1, ... are 0, 0, ...
Given a short exact sequence of modules 0->A->B->C->0, (1) let ...->P_2->^(d_2)P_1->^(d_1)P_0->^(d_0)A->0 (2) ...->Q_2->^(f_2)Q_1->^(f_1)Q_0->^(f_0)C->0 (3) be projective ...
Let {f_n(x)} be a sequence of analytic functions regular in a region G, and let this sequence be uniformly convergent in every closed subset of G. If the analytic function ...
By way of analogy with the eban numbers, iban numbers are defined as numbers whose English names do not contain the letter "i" (i.e., "i" is banned). The first few are 1, 2, ...
The Ishango bone is the oldest known object containing logical carvings. It was discovered in the Congo, and has been dated to be 22000 years old. The middle column of marks ...
A method of matrix diagonalization using Jacobi rotation matrices P_(pq). It consists of a sequence of orthogonal similarity transformations of the form ...
A Keith number is an n-digit integer N>9 such that if a Fibonacci-like sequence (in which each term in the sequence is the sum of the n previous terms) is formed with the ...
The problem of determining how many nonattacking kings can be placed on an n×n chessboard. For n=8, the solution is 16, as illustrated above (Madachy 1979). In general, the ...
The Legendre transform of a sequence {c_k} is the sequence {a_k} with terms given by a_n = sum_(k=0)^(n)(n; k)(n+k; k)c_k (1) = sum_(k=0)^(n)(2k; k)(n+k; n-k)c_k, (2) where ...
![](/common/images/search/spacer.gif)
...