Investigating Special Binary Sequences with Some Computer Help

Daniel C. Fielder and Cecil O. Alford

A chapter in Applications of Fibonacci Numbers, 1999, pp 121-128 from Springer

Abstract: Abstract In this note, we study exclusively n-length binary sequences where at least one 1 is adjacent to (or touching) another 1. For brevity, we refer to them as “binary sequences with some touching 1’s.” They are not to be confused with n-length binary sequences where every 1 is adjacent to at least one other 1 [1]. We let C n denote the collection with unrestricted content, and we let D n denote the subset of C n with even content. (Content is defined as the number of 1’s in a binary sequence.)

Keywords: 05A15; 11B39; 11Y56 (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-011-4271-7_12

Ordering information: This item can be ordered from
http://www.springer.com/9789401142717

DOI: 10.1007/978-94-011-4271-7_12

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().