|
|
A281701
|
|
a(n) is the largest number of coins obtainable by making repeated moves in this puzzle: Start with 1 coin in each of n boxes B(i), i=1..n. One can iterate moves of two types: (1) remove a coin from a nonempty B(i) (i <= n-1) and place two coins in B(i+1); (2) remove a coin from a nonempty B(i) (i <= n-2) and switch the contents of B(i+1) and B(i+2).
|
|
2
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
An Ackermann-like function. The underlying puzzle was invented by Hans Zantema. The derivation and proof of the general formula involving a palindromic sequence of up-arrows is by Richard Stong.
The next term is too large to include (2^16385, it has 4933 digits).
|
|
LINKS
|
|
|
FORMULA
|
Let f_n(x) = 2↑↑...↑x, with n Knuth up-arrows, so f_0(x) = 2x, f_1(x) = 2^x, f_2(x) = 2↑↑x = 2^2^...^2 with x copies of 2, etc.
Let F_n be the composition of f_0, f_1,...,f_(n-4).
Let G_n be the same composition but in the opposite order.
Then a(n) = G_n(F_n(7)), a formula due to Richard Stong.
|
|
EXAMPLE
|
a(5) = f_0(f_1(f_1(f_0(7)))) = 2*2^(2^(2*7)) = 2*2^(2^14) = 2^16385.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|