|
Search: id:A134940
|
|
|
| A134940 |
|
Define f(n) (n>=0) by e(n+1) = e(n) + 3^{n+1} - 1 + 2*f(n), where the numbers e(n) are defined in A134939; then a(n) is the numerator of f(n). |
|
+0
2
|
|
| 0, 17, 424, 7889, 131920, 2099537, 32570104, 498191249, 7559339680, 114166849937, 1719485965384, 25855100073809, 388391603257840, 5830958998038737, 87510144649440664, 1313063982494679569, 19699665930299694400, 295528344080575921937, 4433225354293155251944
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
M. A. Alekseyev and T. Berger, On the expected number of random moves to solve the Tower of Hanoi puzzle, Preprint, 2008.
|
|
FORMULA
|
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
|
|
EXAMPLE
|
The values of f(0), ..., f(3) are 0, 17/3, 424/9, 7889/27.
|
|
CROSSREFS
|
Cf. A134939.
Adjacent sequences: A134937 A134938 A134939 this_sequence A134941 A134942 A134943
Sequence in context: A053106 A114357 A142997 this_sequence A027404 A053114 A035022
|
|
KEYWORD
|
nonn,frac
|
|
AUTHOR
|
Toby Berger (tb6n(AT)virginia.edu), Jan 23 2008
|
|
EXTENSIONS
|
Values of f(4) onwards and general formula found by Max Alekseyev (maxale(AT)gmail.com), Feb 02 2008, Feb 04 2008
|
|
|
Search completed in 0.002 seconds
|
