A007664 - cp's OEIS frontend

A007664 Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm.

n	a(n)
0	0
1	1
2	3
3	5
4	9
5	13
6	17
7	25
8	33
9	41
10	49
11	65
12	81
13	97
14	113
15	129
16	161
17	193
18	225
19	257
20	289
21	321
22	385
23	449
24	513
25	577
26	641
27	705
28	769
29	897
30	1025
31	1153
32	1281
33	1409
34	1537
35	1665
36	1793
37	2049
38	2305
39	2561
40	2817
41	3073
42	3329
43	3585
44	3841
45	4097
46	4609
47	5121
48	5633

[0, 1, 3, 5, 9, 13, 17, 25, 33, 41, 49, 65, 81, 97, 113, 129, 161, 193, 225, 257, 289, 321, 385, 449, 513, 577, 641, 705, 769, 897, 1025, 1153, 1281, 1409, 1537, 1665, 1793, 2049, 2305, 2561, 2817, 3073, 3329, 3585, 3841, 4097, 4609, 5121, 5633]

cp's OEIS Frontend

A007664 Reve's puzzle: number of moves needed to solve the Towers of Hanoi puzzle with 4 pegs and n disks, according to the Frame-Stewart algorithm.

Table of values

List of values