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.

A300576 Number of nights required in the worst case to find the princess in a castle with n rooms arranged in a line (Castle and princess puzzle).

Table of values

n a(n)
1 1
2 2
3 2
4 4
5 6
6 8
7 10
8 12
9 14
10 16
11 18
12 20
13 22
14 24
15 26
16 28
17 30
18 32
19 34
20 36
21 38
22 40
23 42
24 44
25 46
26 48
27 50
28 52
29 54
30 56
31 58
32 60
33 62
34 64
35 66
36 68
37 70
38 72
39 74
40 76
41 78
42 80
43 82
44 84
45 86
46 88
47 90
48 92
49 94
50 96
51 98
52 100
53 102
54 104
55 106
56 108
57 110
58 112
59 114
60 116
61 118
62 120
63 122

List of values

[1, 2, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122]