Counting palindromic binary strings without r-runs of ones

zbMATH Open1342.11025MaRDI QIDQ5404348FDOQ5404348

Authors: Michael A. Nyblom 

Publication date: 24 March 2014

Full work available at URL: http://www.emis.de/journals/JIS/VOL16/Nyblom/nyblom13.html

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Counting palindromes according to \(r\)-runs of ones using generating functions
• Enumerating binary strings without \(r\)-runs of ones
• Binary strings with all runs of odd length
• scientific article; zbMATH DE number 2192217
• Binary strings and the Jacobsthal numbers

zbMATH Keywords

binary strings\(r\)-Fibonacci sequence\(r\)-run of ones

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cited In (8)

• Binary strings with all runs of odd length
• Binary strings of length \(n\) with \(x\) zeros and longest \(k\)-runs of zeros
• Some generalizations on counting binary strings
• Counting palindromes according to \(r\)-runs of ones using generating functions
• Enumerating binary strings without \(r\)-runs of ones
• Title not available (Why is that?)
• Palindromes with forbidden substrings
• On binary palindromes of the form \(10^n\pm 1\)

Uses Software

• OEIS

This page was built for publication: Counting palindromic binary strings without \(r\)-runs of ones

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