Ludic numbers: Difference between revisions

This solution builds aan stackiterator ofwith iteratorsfilters, one for each Ludic number, each extending the previous iteratorfilter. A "master" iterator sits atopat the stacktop and provides the interface to the stack. When the next Ludic number is requested, athe "pulsenext train"odd ripplesnumber sent down andthe uplist of filters and downif ...it makes to the stackend, asit numbersis arethe crossednext offLudic number. A new filter is then attached [to the list(s)iterator] (figurewith a starting index of speech,1 noand numberswhich areindexes to cached)strike.

if(n==2) return(seq.tweak(fcn(n,skipper,idx){ if(n0==idx.isEveninc()%skipper) Void.Skip else n })); // uggg, special case

Walker(fcn(rw){ w:=rw.value; n:=w.next(); rw.set(dropNth(n,w)); n }.fp(Ref([2..]))).push(1);