Binary strings with all runs of odd length

MaRDI QIDQ3110098zbMATH OpenFDO

Authors Ralph P. Grimaldi

Publication date 26 January 2012

zbMATH Keywords

base 2binary stringsdescentsFibonacci numberslevelsLucas numberspalindromesrisesruns

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Special sequences and polynomials (11B83)

Recommendations

• scientific article; zbMATH DE number 2192217
• Counting palindromic binary strings without r-runs of ones
• Binary strings of length n with x zeros and longest k-runs of zeros
• scientific article; zbMATH DE number 2077660
• Up-down ternary strings

Cited in

(15)

• Restricted binary strings and generalized Fibonacci numbers
• scientific article; zbMATH DE number 5844318 (Why is no real title available?)
• Enumerating binary strings without r-runs of ones
• Binary strings and the Jacobsthal numbers
• scientific article; zbMATH DE number 4168688 (Why is no real title available?)
• scientific article; zbMATH DE number 166128 (Why is no real title available?)
• scientific article; zbMATH DE number 2077660 (Why is no real title available?)
• scientific article; zbMATH DE number 1472198 (Why is no real title available?)
• Up-down ternary strings
• The coolest way to generate binary strings
• Binary strings of length n with x zeros and longest k-runs of zeros
• Counting palindromic binary strings without r-runs of ones
• Counting palindromes according to \(r\)-runs of ones using generating functions
• Constructive enumeration of bit strings
• scientific article; zbMATH DE number 2192217 (Why is no real title available?)

This page was built for publication: Binary strings with all runs of odd length

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3110098)