10-letter strings with no 3 consecutive
Source:
March 26, 2015
AMCAIMEAIME IIcombinatoricscountingrecursion
Problem Statement
There are possible 10-letter strings in which each letter is either an A or a B. Find the number of such strings that do not have more than 3 adjacent letters that are identical.