Talk:The Haruhi Problem/@comment-92.236.80.154-20120708000458

Well, my fellow anon, I like the predictions your formula gives. It asserts the lower bound for n=3 and n=4 are 9 and 33 respectively, and I have developed an algorithm that gives a result of 9 and 37 for such cases, which I think is quite encouraging. The formula I have that calculates the length of the string generated by said algorithm predicts a string length of 99,632,332,821; which has an error of only just over 6% of the lower bound value.