We want to count the number of 8-letter sequences using letters A, T, C, G, such that exactly two As appear and no two As are adjacent. - Treasure Valley Movers