I have X number of light bulbs and I would like to calculate the total number of combinations of 2 adjacent bulbs failing + any other bulb (or no other bulb). For example for five bulbs I think there is 14 combinations (o indicates a bulb and x indicates a failed bulb):
I have 35 bulbs, is it possible to calculate this mathematically?
I hope I am in the correct section.
Combination | o | o | o | o | o |
1 | x | x | |||
2 | x | x | x | ||
3 | x | x | x | ||
4 | x | x | x | ||
5 | x | x | x | x | |
6 | x | x | x | x | |
7 | x | x | |||
8 | x | x | x | ||
9 | x | x | x | ||
10 | x | x | x | x | |
11 | x | x | |||
12 | x | x | x | ||
13 | x | x | x | ||
14 | x | x | x | x | |
I have 35 bulbs, is it possible to calculate this mathematically?
I hope I am in the correct section.