id:A055622 - OEIS Search Results

Search: id:A055622

Displaying 1-1 of 1 results found.

page 1

Minimum solution for tri-color tower of Hanoi, restricted so like colors can't be together.

+0
1

1, 3, 7, 19, 43, 99, 235, 535, 1239, 2879, 6619, 15323, 35451, 81823, 189263, 437543, 1011059, 2337731, 5403987, 12491223, 28877687, 66755519, 154315883, 356738411, 824668747, 1906384015, 4407016991, 10187707927, 23550975203 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`William H. Paulsen, Tri-color Tower of Hanoi`
	FORMULA	`a(n) = a(n-1) + 2 a(n-2) + 7 a(n-3) - 5 a(n-4) - 8 a(n-5) - 14 a(n-6) + 2 a(n-7) + 4 a(n-8) + 4 a(n-9) + 8 a(n-10)`
	CROSSREFS	`Adjacent sequences: A055619 A055620 A055621 this_sequence A055623 A055624 A055625` `Sequence in context: A090689 A126938 A127990 this_sequence A075900 A069051 A136041`
	KEYWORD	`nonn`
	AUTHOR	`William H. Paulsen (wpaulsen(AT)csm.astate.edu), Jun 04 2000`
	EXTENSIONS	`Additional comments from Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 02 2001`

page 1

Search completed in 0.002 seconds

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.

AT&T Labs Research