I don't want \(101\) and \(111\).

Discrete Mathematics Level 5

Let \(a_{n}\) be the number of words of \(0-1\) strings of length \(n\) such that neither \(101\) nor \(111\) occur as 3-digit blocks. Find \(a_{16}\).

Note: This is an old IMO problem.

Excel in math and science

Master concepts by solving fun, challenging problems.

It's hard to learn from lectures and videos

Learn more effectively through short, interactive explorations.

Used and loved by over 5 million people

Learn from a vibrant community of students and enthusiasts, including olympiad champions, researchers, and professionals.