Counting palindromic binary strings without \(r\)-runs of ones (Q5404348)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6272437
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Counting palindromic binary strings without \(r\)-runs of ones |
scientific article; zbMATH DE number 6272437 |
Statements
24 March 2014
0 references
binary strings
0 references
\(r\)-Fibonacci sequence
0 references
\(r\)-run of ones
0 references
0.8622095584869385
0 references
0.8349646329879761
0 references
0.8166186809539795
0 references
0.8084835410118103
0 references
