Name
Abstract | ||
|---|---|---|
Let γ(n) be the number of C∞-words of length n. It is shown that the second difference γ″(n) is the number of words of length n in a well-behaved subset of the set of C∞-words. A formula for γ(n) for some n is derived, and is used to explain patterns noted by F. M. Dekking in the values of γ. |
Year | DOI | Venue |
|---|---|---|
1989 | 10.1016/0097-3165(89)90076-9 | Journal of Combinatorial Theory, Series A |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Enumeration,Mathematics | Journal | 51 |
Issue | ISSN | Citations |
1 | 0097-3165 | 6 |
PageRank | References | Authors |
0.69 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| William D. Weakley | 1 | 56 | 10.40 |