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.

A248604 Numbers a(n) which are the minimum number of moves needed in a variation of the tower of Hanoi with 4 towers and n disks.

Table of values

n a(n)
1 1
2 3
3 5
4 9
5 13
6 21
7 37
8 69
9 133
10 261
11 517
12 1029
13 2053
14 4101
15 8197
16 16389
17 32773
18 65541
19 131077
20 262149
21 524293
22 1048581
23 2097157
24 4194309
25 8388613
26 16777221
27 33554437
28 67108869
29 134217733
30 268435461
31 536870917
32 1073741829
33 2147483653
34 4294967301
35 8589934597

List of values

[1, 3, 5, 9, 13, 21, 37, 69, 133, 261, 517, 1029, 2053, 4101, 8197, 16389, 32773, 65541, 131077, 262149, 524293, 1048581, 2097157, 4194309, 8388613, 16777221, 33554437, 67108869, 134217733, 268435461, 536870917, 1073741829, 2147483653, 4294967301, 8589934597]

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

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