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.

A341579 Number of steps needed to solve the Towers of Hanoi exchanging disks puzzle with 3 pegs and n disks.

Table of values

n a(n)
0 0
1 1
2 3
3 7
4 13
5 25
6 47
7 89
8 165
9 307
10 569
11 1057
12 1959
13 3633
14 6733
15 12483
16 23137
17 42889
18 79495
19 147353
20 273125
21 506259
22 938377
23 1739345
24 3223975
25 5975841
26 11076573
27 20531107
28 38055633
29 70538425
30 130747207
31 242347849
32 449206325
33 832631027
34 1543331769
35 2860658497

List of values

[0, 1, 3, 7, 13, 25, 47, 89, 165, 307, 569, 1057, 1959, 3633, 6733, 12483, 23137, 42889, 79495, 147353, 273125, 506259, 938377, 1739345, 3223975, 5975841, 11076573, 20531107, 38055633, 70538425, 130747207, 242347849, 449206325, 832631027, 1543331769, 2860658497]

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

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