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.

A182058 Number of moves needed to solve the Towers of Hanoi puzzle with 6 pegs and n disks.

Table of values

n a(n)
1 1
2 3
3 5
4 7
5 9
6 13
7 17
8 21
9 25
10 29
11 33
12 37
13 41
14 45
15 49
16 57
17 65
18 73
19 81
20 89

List of values

[1, 3, 5, 7, 9, 13, 17, 21, 25, 29, 33, 37, 41, 45, 49, 57, 65, 73, 81, 89]