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.

A060590 Numerator of the expected time to finish a random Tower of Hanoi problem with n disks using optimal moves.

Table of values

n a(n)
0 0
1 2
2 2
3 14
4 10
5 62
6 42
7 254
8 170
9 1022
10 682
11 4094
12 2730
13 16382
14 10922
15 65534
16 43690
17 262142
18 174762
19 1048574
20 699050
21 4194302
22 2796202
23 16777214
24 11184810
25 67108862
26 44739242
27 268435454
28 178956970
29 1073741822
30 715827882
31 4294967294

List of values

[0, 2, 2, 14, 10, 62, 42, 254, 170, 1022, 682, 4094, 2730, 16382, 10922, 65534, 43690, 262142, 174762, 1048574, 699050, 4194302, 2796202, 16777214, 11184810, 67108862, 44739242, 268435454, 178956970, 1073741822, 715827882, 4294967294]

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

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