proposed

approved

editing

proposed

M. A. Alekseyev and T. Berger, <a href="http://arxiv.org/abs/1304.3780">Solving the Tower of Hanoi with Random Moves</a>, arXiv:1304.3780 [math. CO], 2013-204; In: J. Beineke, J. Rosenhouse (eds.) The Mathematics of Various Entertaining Subjects: Research in Recreational Math, Princeton University Press, 2016, pp. 65-79. ISBN 978-0-691-16403-8

<a href="/index/Rec">Index entries for linear recurrences with constant coefficients</a>, signature (32,-342,1440,-2025).

<a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (32,-342,1440,-2025).

approved

editing

editing

approved

Define f(n) (n>=0) by e(n+1) = e(n) + 3^{n+1} - 1 + 2*f(n), where the rational numbers e(n) are defined in A134939; then a(n) is the numerator of f(n).

M. A. Alekseyev and T. Berger, <a href="http://arxiv.org/abs/1304.3780">Solving the Tower of Hanoi with Random Moves</a>, Preprint, 2013. In: J. Beineke, J. Rosenhouse (eds.) The Mathematics of Various Entertaining Subjects: Research in Recreational Math, Princeton University Press, 2016, pp. 65-79. ISBN 978-0-691-16403-8

f(n) = (6*3^n-1)*(5^n-3^n)/(2*3^n); a(n) = (6*3^n-1)*(5^n-3^n)/2. - _Max Alekseyev, _, Feb 04 2008

Values of f(4) onwards and a general formula found by Max Alekseyev, Feb 02 2008, Feb 04 2008

approved

editing

<a href="/index/Rec">Index to sequences with entries for linear recurrences with constant coefficients</a>, signature (32,-342,1440,-2025).

<a href="/index/Rea#recLCCRec">Index to sequences with linear recurrences with constant coefficients</a>, signature (32,-342,1440,-2025).

editing

approved

M. A. Alekseyev and T. Berger, On the expected number of random moves to solve the Tower of Hanoi puzzle, Preprint, 2008.

M. A. Alekseyev and T. Berger, <a href="http://arxiv.org/abs/1304.3780">Solving the Tower of Hanoi with Random Moves</a>, Preprint, 2013.

approved

editing