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.

A060586 Minimum number of moves required to reach position n starting from 0 in Tower of Hanoi (with three pegs: 0,1,2), where with position n written in base 3, xyz means smallest disk is on peg z, second smallest is on peg y, third smallest on peg x, etc. and leading zeros indicate largest disks are all on peg 0.

Table of values

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

List of values

[0, 1, 1, 3, 3, 2, 3, 2, 3, 7, 6, 7, 6, 7, 7, 5, 5, 4, 7, 7, 6, 5, 4, 5, 6, 7, 7, 15, 15, 14, 13, 12, 13, 14, 15, 15, 12, 13, 13, 15, 15, 14, 15, 14, 15, 11, 10, 11, 10, 11, 11, 9, 9, 8, 15, 14, 15, 14, 15, 15, 13, 13, 12, 11, 11, 10, 9, 8, 9, 10, 11, 11, 12, 13, 13, 15, 15, 14, 15, 14]