Enumerating binary strings without \(r\)-runs of ones (Q3167231)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Enumerating binary strings without r-runs of ones |
scientific article; zbMATH DE number 6101361
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Enumerating binary strings without \(r\)-runs of ones |
scientific article; zbMATH DE number 6101361 |
Statements
2 November 2012
0 references
binary strings
0 references
\(r\)-Fibonacci sequence
0 references
\(r\)-runs of ones
0 references
0.8349646329879761
0 references
0.7942120432853699
0 references
0.789107084274292
0 references
0.772300660610199
0 references
