Makes more sense when you look at it closely
(a x b = a distinct strings of length b)
1x1, 1x2
2x2, 1x3
3x3, 2x4
5x4, 3x5
8x5, 5x6
Each axn transfers to axn+1, axn+1 (since they can either add 1 orb or 2, depending if FA occurs or not)
Each bxn+1 transfers to bxn+1 (since it's already at n+1 hits)
b, a => b+a = c, b
c, b => c+b = d, c
Each time the 1st number shifts to the 2nd spot, so it's effectively just repeating that number. Then the new 1st number is the sum of the 2 previous numbers. Hooray for fibonacci
(a x b = a distinct strings of length b)
1x1, 1x2
2x2, 1x3
3x3, 2x4
5x4, 3x5
8x5, 5x6
Each axn transfers to axn+1, axn+1 (since they can either add 1 orb or 2, depending if FA occurs or not)
Each bxn+1 transfers to bxn+1 (since it's already at n+1 hits)
b, a => b+a = c, b
c, b => c+b = d, c
| id | 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| 1 | 1 | 1 | ||||||
| 2 | 1 | 2 | ||||||
| 3 | 2 | 3 | ||||||
| 4 | 3 | 5 | ||||||
| 5 | 5 | 8 | ||||||
| 6 | 8 | 13 | ||||||
| 8 | 13 | 21 |
Each time the 1st number shifts to the 2nd spot, so it's effectively just repeating that number. Then the new 1st number is the sum of the 2 previous numbers. Hooray for fibonacci