[seqfan] Re: As much as I hate "base" sequences...

[Hans Havermann]

David Wilson: "For a = A235601, let S(0) = {1}, then for each n >= 1, compute set S(n) of possible predecessors of elements of S(n-1). Then a(n) is the smallest element of S(n). Using this approach, I was able to compute up to a(100), and could have gone further, but the elements were getting very large."

Not too large. I found that the size of S fluctuates wildly, never exceeding 120 and dropping to 0 for A235601(441). I've asked David to confirm (or refute) this computation.