User blog comment:Deedlit11/Bignum Bakeoff appetizer/@comment-5529393-20140922175020/@comment-24061664-20140923045907

Deed's code worked but Vel's code didn't.

int i = 4, b = 2; B(x,y) {return y ? y % b * pow(b+1, B(0,x)) + B(x+1, y/b):0;} main {while(i = B(0,i)-1) printf ("%d,",i),b++; printf("%d step\n",b);}
 * 1) include 
 * 2) include 

26,41,60,83,109,139,173,211,253,299,348,401,458,519,584,653,726,803,884,...

int i = 4, b = 2; B(x,y) {return y && y % b * pow(b+1, B(0,x)) + B(x+1, y/b);} main {while(i = B(0,i)-1) printf ("%d,",i),b++; printf("%d step\n",b);}
 * 1) include 
 * 2) include 

2 step