cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A290187 Minimum number of moves to rearrange a Tower of Hanoi puzzle with 3 colors. There are 3 rods with n discs in descending sizes. On the first rod there are n red discs, on the 2nd n blue discs and on the 3rd n white ones.

Table of values

n a(n)
1 5
2 23
3 68
4 168
5 377
6 801
7 1657
8 3377
9 6825
10 13729
11 27545
12 55185

List of values

[5, 23, 68, 168, 377, 801, 1657, 3377, 6825, 13729, 27545, 55185]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.