Talk:Block subsequence theorem

I guess that n(k) > {n,n (1) 2}:

n(1) = \(3 > \lbrace 1,1 (1) 2 \rbrace = 1\) n(2) = \(11 > \lbrace 2,2 (1) 2 \rbrace = 4\) n(3) > \(2 \uparrow^{7197}158386 > \lbrace 3,3 (1) 2 \rbrace = 3 \uparrow\uparrow\uparrow 3\)

Since n(k) grows faster than \(f_{\omega^\omega}(n)\), n(4) > \(\lbrace 4,4,4,4 \rbrace\) Ikosarakt1 (talk) 11:44, January 7, 2013 (UTC)