A137695 - cp's OEIS frontend

A137695 Tower of Hanoi with p pegs: A(p,n) = number of moves needed for n disks, using Frame's or Stewart's algorithm, read by columns of the upper right triangle of rows p >= 3, columns n >= p-2.

n	a(n)
1	1
2	3
3	3
4	7
5	5
6	5
7	15
8	9
9	7
10	7
11	31
12	13
13	11
14	9
15	9
16	63
17	17
18	15
19	13
20	11
21	11
22	127
23	25
24	19
25	17
26	15
27	13
28	13
29	255
30	33
31	23
32	21
33	19
34	17
35	15
36	15
37	511
38	41
39	27
40	25
41	23
42	21
43	19
44	17
45	17
46	1023
47	49
48	31
49	29
50	27
51	25
52	23
53	21
54	19
55	19
56	2047
57	65
58	39
59	33
60	31
61	29
62	27
63	25
64	23
65	21
66	21
67	4095
68	81
69	47
70	37
71	35

[1, 3, 3, 7, 5, 5, 15, 9, 7, 7, 31, 13, 11, 9, 9, 63, 17, 15, 13, 11, 11, 127, 25, 19, 17, 15, 13, 13, 255, 33, 23, 21, 19, 17, 15, 15, 511, 41, 27, 25, 23, 21, 19, 17, 17, 1023, 49, 31, 29, 27, 25, 23, 21, 19, 19, 2047, 65, 39, 33, 31, 29, 27, 25, 23, 21, 21, 4095, 81, 47, 37, 35]

cp's OEIS Frontend

A137695 Tower of Hanoi with p pegs: A(p,n) = number of moves needed for n disks, using Frame's or Stewart's algorithm, read by columns of the upper right triangle of rows p >= 3, columns n >= p-2.

Table of values

List of values