[seqfan] Re: A154714

Maximilian Hasler maximilian.hasler at gmail.com
Thu Jan 15 14:11:17 CET 2009


On Thu, Jan 15, 2009 at 5:31 AM, Vladimir Reshetnikov
<v.reshetnikov at gmail.com> wrote:
> Hi,
>
> Can anybody calculate an upper bound for A154714(5)?
> I believe that finding the exact value is unrealistic.

In any case it would not fit on three lines, neither in a b-file.
a(5) is obtained by applying 2048 times the operation f(3,.) to 2048,
with f(3, 2^p) = 2^( 2^p+p ).
Thus a(5) is larger than
2^(2^(....2^(2^11+11)...)), with 2049(?) occurrences of " 2^ "

I think even an upper limit (which is e.g. given by replacing the +11
by +12) can only be expressed in chained arrow notation or so, i.e.
not much better than the above.

Maximilian




More information about the SeqFan mailing list