Search Results for ""
641 - 650 of 1609 for Lookand Say SequenceSearch Results
![](/common/images/search/spacer.gif)
A solid of revolution is a solid enclosing the surface of revolution obtained by rotating a 1-dimensional curve, line, etc. about an axis. A portion of a solid of revolution ...
Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...
A special type of binary tree obtained by starting with the fractions 0/1 and 1/0 and iteratively inserting (m+m^')/(n+n^') between each two adjacent fractions m/n and ...
The transformation S[{a_n}_(n=0)^N] of a sequence {a_n}_(n=0)^N into a sequence {b_n}_(n=0)^N by the formula b_n=sum_(k=0)^NS(n,k)a_k, (1) where S(n,k) is a Stirling number ...
The first strong law of small numbers (Gardner 1980, Guy 1988, 1990) states "There aren't enough small numbers to meet the many demands made of them." The second strong law ...
A region in a knot or link projection plane surrounded by a circle such that the knot or link crosses the circle exactly four times. Two tangles are equivalent if a sequence ...
Roman (1984, p. 2) describes umbral calculus as the study of the class of Sheffer sequences. Umbral calculus provides a formalism for the systematic derivation and ...
A number of the form aba..., abab..., etc. The first few nontrivial undulants (with the stipulation that a!=b) are 101, 121, 131, 141, 151, 161, 171, 181, 191, 202, 212, ... ...
A sequence of functions {f_n}, n=1, 2, 3, ... is said to be uniformly convergent to f for a set E of values of x if, for each epsilon>0, an integer N can be found such that ...
A divisor d of n for which GCD(d,n/d)=1, (1) where GCD(m,n) is the greatest common divisor. For example, the divisors of 12 are {1,2,3,4,6,12}, so the unitary divisors are ...
![](/common/images/search/spacer.gif)
...