A347789 - cp's OEIS frontend

A347789 a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks.

n	a(n)
1	0
2	2
3	4
4	8
5	12
6	20
7	28
8	44
9	60
10	92
11	124
12	188
13	252
14	380
15	508
16	764
17	1020
18	1532
19	2044
20	3068
21	4092
22	6140
23	8188
24	12284
25	16380
26	24572
27	32764
28	49148
29	65532
30	98300
31	131068
32	196604
33	262140
34	393212
35	524284
36	786428
37	1048572
38	1572860
39	2097148
40	3145724
41	4194300
42	6291452

[0, 2, 4, 8, 12, 20, 28, 44, 60, 92, 124, 188, 252, 380, 508, 764, 1020, 1532, 2044, 3068, 4092, 6140, 8188, 12284, 16380, 24572, 32764, 49148, 65532, 98300, 131068, 196604, 262140, 393212, 524284, 786428, 1048572, 1572860, 2097148, 3145724, 4194300, 6291452]

cp's OEIS Frontend

A347789 a(n) is the number of times that only 2 pegs have disks on them during the optimal solution to a Towers of Hanoi problem with n disks.

Table of values

List of values