Binary strings and the Jacobsthal numbers

MaRDI QIDQ3378265zbMATH OpenFDO

Authors Ralph P. Grimaldi

Publication date 30 March 2006

zbMATH Keywords

linear recurrences with constant coefficients

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Special sequences and polynomials (11B83) Recurrences (11B37)

Recommendations

• On Jacobsthal binary sequences
• scientific article; zbMATH DE number 5533275
• Binary strings with all runs of odd length
• scientific article; zbMATH DE number 2192217
• Binary strings of length n with x zeros and longest k-runs of zeros

Cited in

(11)

• On the Varshamov-Tenengolts construction on binary strings
• Counting palindromic binary strings without r-runs of ones
• Binary strings of length n with x zeros and longest k-runs of zeros
• Counting certain binary strings
• Some generalizations on counting binary strings
• scientific article; zbMATH DE number 6982125 (Why is no real title available?)
• Binary signed-digit integers and the Stern diatomic sequence
• On Jacobsthal binary sequences
• scientific article; zbMATH DE number 3927976 (Why is no real title available?)
• The coolest way to generate binary strings
• Sequences of binary strings with relation of conditional simplicity

This page was built for publication: Binary strings and the Jacobsthal numbers

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