About this document
Chef by gyugam is a document available to read on EtoBox.
This document describes a problem where a brother wants to invite people to a party from houses on a street without inviting any three consecutive houses, as that would create a crowd. It provides an explanation that this is equivalent to finding the number of sequences of 0s and 1s of length N with at least three consecutive 1s. This can be solved using the fact that the number of sequences with no more than two consecutive 1s follows a Tribonacci recurrence, and subtracting that from the total number of p
- Author
- gyugam
- Language
- EN