

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 <= n1) and place two coins in B(i+1); (2) remove a coin from a nonempty B(i) (i <= n2) and switch the contents of B(i+1) and B(i+2).


2




OFFSET

1,2


COMMENTS

An Ackermannlike function. The underlying puzzle was invented by Hans Zantema. The derivation and proof of the general formula involving a palindromic sequence of uparrows is by Richard Stong.
The next term is too large to include (2^16385, it has 4933 digits).


LINKS

Table of n, a(n) for n=1..4.
Zuming Feng, PoShen Loh, and Yi Sun, 51st International Mathematical Olympiad, Math. Mag. 83 (2010), pp. 320323.
Terence Tao, Minipolymath2 project: IMO 2010 Q5 (2010)
A. van den Brandhof, J. Guichelaar, and A. Jaspers, Half a Century of Pythagoras Magazine, MAA, 2015, 225
Stan Wagon, The Generous Automated Teller Machine
Stan Wagon, Richard Stong's proof of the uparrow formula
Wikipedia, Knuth's uparrow notation


FORMULA

Let f_n(x) = 2↑↑...↑x, with n Knuth uparrows, 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_(n4).
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

Cf. A307611.
Sequence in context: A280020 A232806 A270349 * A101303 A148751 A148752
Adjacent sequences: A281698 A281699 A281700 * A281702 A281703 A281704


KEYWORD

nonn,nice


AUTHOR

Stan Wagon, Jan 27 2017


STATUS

approved



