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.

A007798 Expected number of random moves in Tower of Hanoi problem with n disks starting with a randomly chosen position and ending at a position with all disks on the same peg.

Table of values

n a(n)
0 0
1 0
2 2
3 18
4 116
5 660
6 3542
7 18438
8 94376
9 478440
10 2411882
11 12118458
12 60769436
13 304378620
14 1523487422
15 7622220078
16 38125449296
17 190670293200
18 953480606162
19 4767790451298
20 23840114517956
21 119204059374180
22 596030757224102
23 2980185167180118
24 14901019979079416

List of values

[0, 0, 2, 18, 116, 660, 3542, 18438, 94376, 478440, 2411882, 12118458, 60769436, 304378620, 1523487422, 7622220078, 38125449296, 190670293200, 953480606162, 4767790451298, 23840114517956, 119204059374180, 596030757224102, 2980185167180118, 14901019979079416]