This is a little program to find the smallest x with 0 < x <= 1000000, where
a(n+1) = NumberOfChars(EnglishWord(a(n))) and a(0) = x resulting in the longest chain before hitting a(n) = 4.
The program returns:
THREEHUNDREDTWENTYTHREE (323), TWENTYTHREE (23), ELEVEN (11), SIX (6), THREE (3), FIVE (5), FOUR (4)