|
Search: id:A022543
|
|
|
| A022543 |
|
Number of unique 'failure tables' for a string of length n. |
|
+0
1
|
|
| 1, 2, 4, 9, 20, 47, 110, 263, 630, 1525, 3701, 9039, 22140, 54460, 134339, 332439, 824735, 2051307
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
Knuth-Morris-Pratt pattern matching algorithm.
|
|
LINKS
|
Dennis Moore, W. F. Smyth and Dianne Miller, Counting distinct strings, Algorithmica, Vol. 23 (1999), 1-13.
|
|
EXAMPLE
|
For example a string of length 3 can have one of the following 4 'failure tables': 012, 001, 010, 000.
|
|
CROSSREFS
|
Sequence in context: A039808 A138164 A130802 this_sequence A036618 A003018 A035084
Adjacent sequences: A022540 A022541 A022542 this_sequence A022544 A022545 A022546
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
Dianne Miller (millerdm(AT)mcmaster.ca)
|
|
|
Search completed in 0.002 seconds
|
