This site is supported by donations to The OEIS Foundation.

Template:Sequence of the Day for February 10

From OeisWiki
Jump to: navigation, search


Intended for: February 10, 2012

Timetable

  • First draft entered by Alonso del Arte on November 6, 2011
  • Draft reviewed by Daniel Forgues on February 10, 2016
  • Draft to be approved by January 10, 2012

Yesterday's SOTD * Tomorrow's SOTD

The line below marks the end of the <noinclude> ... </noinclude> section.



A060590: Numerator of the expected time to finish a random tower of Hanoi problem with
n, n ≥ 0,
disks using optimal moves.
{ 0, 2, 2, 14, 10, 62, 42, 254, ... }
The formula for the numerator (this sequence) is
2 ( 2n  −  1) ( 2  −  ( − 1)n  )
3
, the formula for the denominator (A010684) being
2  −  ( − 1)n
.
For example, for
n = 1
, the expected time is
2
3
since
2
times out of
3
we have to do one move.