The Goodstein Sequence
C_K_Yang Walker czp001 liuguangxi zimpha a_forsteri mafia Min_25 C3PO Philippe_57721 gerrob mathpseudo sinan hervas benito255 lesnik7 nielkh
Public  05/19/17  7xp  Programming  85.0% 
We define the hereditary basen representation of a number as follow:
For instance, if $n = 266$, and $base = 2$, its hereditary base2 representation is:
$266 = 2^1+2^3+2^8$
$\quad = 2^1+2^{1+2}+2^{2^3}$
$\quad = 2^1+2^{1+2}+2^{2^{1+2}}$
We express n in base 2 and recursively every exponent in base 2.
Let's define the $ G_k $ sequence as follow:
$G_1(n) = n$
$G_2(n) = $ Take the hereditary base2 representation of n, replace each 2s with 3s and substract 1
$G_k(n) = $ Take the hereditary basek representation of $G_{k1}(n)$, replace each $k$s with $(k+1)$s and substract 1
Here the first values for $G_k(6)$
$G_1(6) = 6$
$G_2(6) = 29$
$G_3(6) = 257$
$G_4(6) = 3125$
$G_5(6) = 46655$
$G_6(6) = 98039$
$G_7(6) = 187243$
$G_8(6) = 332147$
Find $G_{50}(13)$
[My timing: < 1 sec]
For instance, if $n = 266$, and $base = 2$, its hereditary base2 representation is:
$266 = 2^1+2^3+2^8$
$\quad = 2^1+2^{1+2}+2^{2^3}$
$\quad = 2^1+2^{1+2}+2^{2^{1+2}}$
We express n in base 2 and recursively every exponent in base 2.
Let's define the $ G_k $ sequence as follow:
$G_1(n) = n$
$G_2(n) = $ Take the hereditary base2 representation of n, replace each 2s with 3s and substract 1
$G_k(n) = $ Take the hereditary basek representation of $G_{k1}(n)$, replace each $k$s with $(k+1)$s and substract 1
Here the first values for $G_k(6)$
$G_1(6) = 6$
$G_2(6) = 29$
$G_3(6) = 257$
$G_4(6) = 3125$
$G_5(6) = 46655$
$G_6(6) = 98039$
$G_7(6) = 187243$
$G_8(6) = 332147$
Find $G_{50}(13)$
[My timing: < 1 sec]
New Members
 CcGaviria 2w:2d
 wuyingddg 2w:3d
 curiosity_def 2w:3d
 skywalkert 2w:4d
 baihacker 2w:6d
Fresh Problems

Harmonic variations 1d:20h
solved by 5 
Special squarefree sum 6d:5h
solved by 5 
A Staggering Sequence 1w:2d
solved by 10 
Enhanced perfect power 1w:6d
solved by 8 
Subareas 2w:4d
solved by 4