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.

A128202 Configuration of discs on pegs after n steps of the optimal solution to the Towers of Hanoi problem moving an odd number of discs from peg 0 to peg 2, or an even number from peg 0 to peg 1.

Table of values

n a(n)
1 0
2 2
3 5
4 4
5 22
6 21
7 24
8 26
9 53
10 52
11 46
12 45
13 36
14 38
15 41
16 40
17 202
18 201
19 204
20 206
21 197
22 196
23 190
24 189
25 216
26 218
27 221
28 220
29 238
30 237
31 240
32 242
33 485
34 484
35 478
36 477
37 468
38 470
39 473
40 472
41 418
42 417
43 420
44 422
45 413
46 412
47 406
48 405
49 324
50 326
51 329
52 328
53 346
54 345
55 348
56 350

List of values

[0, 2, 5, 4, 22, 21, 24, 26, 53, 52, 46, 45, 36, 38, 41, 40, 202, 201, 204, 206, 197, 196, 190, 189, 216, 218, 221, 220, 238, 237, 240, 242, 485, 484, 478, 477, 468, 470, 473, 472, 418, 417, 420, 422, 413, 412, 406, 405, 324, 326, 329, 328, 346, 345, 348, 350]

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

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