I am studying a recursion below:
Now I'm not great at writing in Mathematica. It's been a while since I've used it. So I looked up some old work and came across this method in Mathematica; it's a "memory" property in the code, or thats how I remember it being described to me. So I did it, and wrote the code below.
And so here's the question. How can I get it so that the 6th B, 7th B, ..., kth number B[k], are written or outputted in the elegant factored form as in the previous 5, without that clunky Binomial function in the denominator? I'm interested in the distribution of the denominator's factorization.