0,2

In other words, a sequence of moves starting with all disks on the starting peg, ending with all disks on the destination peg and never more than once producing the same distribution of disks among the pegs (assuming 3 pegs).

Wikipedia, Tower of Hanoi

a(n+1)=(a(n)^2)(a(n)+1)

log a(n) grows somewhat faster than O(3^n).

f:=proc(n) option remember; if n = 0 then 1 else f(n-1)^2*(f(n-1)+1); fi; end;

(Scheme)

(define (next n) (* n n (+ n 1)))

(define (list-elements nr-of-elements n0 next)

(let list-elements ((i 0) (n n0))

(show i n)

(let ((i (add1 i)))

(if (< i nr-of-elements) (list-elements i (next n))))))

(define (show i n) (printf "N(~a)=~a~n~n" i n))

(list-elements 6 1 next)

Sequence in context: A085912 A085895 A090904 this_sequence A050649 A003042 A000887

Adjacent sequences: A125292 A125293 A125294 this_sequence A125296 A125297 A125298

nonn

Jos Koot (jos.koot(AT)telefonica.net), Dec 08 2006

Checked by N. J. A. Sloane (njas(AT)research.att.com), Feb 10 2007. The next term is too large to include.