User blog comment:Deedlit11/Bignum Bakeoff appetizer/@comment-5529393-20140916022609/@comment-24061664-20140916125231

Verified with

int z, k = 3, b = 2; int u(int n) { int i = -1, o = 1; while (i++, o * b <= n) o *= b; return n ? pow(b + 1, u(i)) + u(n - o) : n; }
 * 1) include 
 * 2) include 

int main { for (z = 2; z < 100; z ++) { k = z; b=1; printf ("G(%d): ",k-1); while (b++, printf ("%d, ",k-1), fflush( stdout ), k = u(--k)); printf ("fin. %d steps.\n",b); } }

Reuslt matches http://oeis.org/A056193

G(1): 1, 0, fin. 3 steps. G(2): 2, 2, 1, 0, fin. 5 steps. G(3): 3, 3, 3, 2, 1, 0, fin. 7 steps. G(4): 4, 26, 41, 60, 83, 109, 139, 173, 211, 253, 299, 348, 401, 458, 519, 584, 653, 726, 803, 884, 969, 1058, 1151, 1222, 1295, 1370, 1447, 1526, 1607, 1690, 1775, 1862, 1951, 2042, 2135, 2230, 2327, 2426, 2527, 2630, 2735, 2842, 2951, 3062, 3175, 3290, 3407, 3525, 3645, 3767, 3891, 4017, 4145, 4275, 4407, 4541, 4677, 4815, 4955, 5097, 5241, 5387, 5535, 5685, 5837, 5991, 6147, 6305, 6465, 6627, 6791, 6957, 7125, 7295, 7467, 7641, 7817, 7995, 8175, 8357, 8541, 8727, 8915, 9105, 9297, 9491, 9687, 9885, 10085, 10287, 10491, 10697, 10905, 11115, 11327, ...