Strings with no two adjacent 1s
Count length-n binary strings avoiding "11" — a Fibonacci recursion.
Difficulty
Loading…
Answers are whole numbers.
Combinatorics · Strings with no two adjacent 1s
Free during beta
Count length-n binary strings avoiding "11" — a Fibonacci recursion.
Answers are whole numbers.
Free during beta