Binary Strings Without Odd Runs of Zeros

@article{Grimaldi2005BinarySW,
  title={Binary Strings Without Odd Runs of Zeros},
  author={Ralph Grimaldi and Silvia Heubach},
  journal={Ars Comb.},
  year={2005},
  volume={75}
}
We look at binary strings of length n which contain no odd run of zeros and express the total number of such strings, the number of zeros, the number of ones, the total number of runs, and the number of levels, rises and drops as functions of the Fibonacci and Lucas numbers and also give their generating functions. Furthermore, we look at the decimal value of the sum of all binary strings of length n without odd runs of zeros considered as base 2 representations of decimal numbers, which… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
3 Extracted Citations
5 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-5 of 5 references

Compositions without the Summand

  • R. P. Grimaldi
  • Congressus Numerantium
  • 2001
1 Excerpt

Compositions with Odd Summands

  • R. P. Grimaldi
  • Congressus Numerantium
  • 2000
3 Excerpts

Discrete and Combinatorial Mathematics, 4 edition

  • R. P. Grimaldi
  • 1999
1 Excerpt

Generatingfunctionology, 2 edition

  • H. S. Wilf
  • Academic Press Inc,
  • 1994
2 Excerpts

Compositions with Ones and Twos

  • K. Alladi, V. E. Hoggatt, Jr.
  • Fibonacci Quarterly
  • 1975
1 Excerpt

Similar Papers

Loading similar papers…