Markov chains seemed like an interesting approach. I put this to followers as that seemed to be the most straight forward application... get a distribution of the numbers (all of them) that followed the last draw and present the distribution list, sorted by frequency descending... this is literally the layout of the transition probabilities for each state transition (draw). Even though, like the lottery, Markov Chains are "memoryless" and only depend on the last state, lottery data does not even do this.... having used chi square goodness of fit on samples ranging from 10 draws to entire histories, the scoring indicates that the groups are indeed representative of discrete uniform distributions. Bottom line, not enough winners predicted to make a system profitable.
I also did that inter quartile range of Hot/Neutral/Cold... the problem was "when" was this hot? What sample size was the right one to use? To overcome stale hots... I added a count since each number was last drawn. The sample size chosen was the number of draws for a number to appear 15 times in the sample vs the expectancy... so pick 3, 150 draws could produce a frequency of 15, so how much above it or below it determined it's hot cold or neutral label.... then I refined it to include neutrals above, exactly at and below the median, giving Hot, Neutral Above median, neutral median, neutral Below median and Cold. None of it helps predict anything.
I am taking a break to learn bioinformatics and biostatistics, but once I get comfortable with the concepts and techniques of Hidden Markov Models, I may revisit the analysis of lottery data through that lens... but right now, out of ideas.