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.

A089636 Least k, 1 <= k <= 2^n, such that the continued fraction for 2^n/k contains the maximum number of elements.

Table of values

n a(n)
1 1
2 3
3 5
4 9
5 23
6 39
7 79
8 158
9 281
10 741
11 1145
12 2297
13 4495
14 10111
15 20223
16 40446
17 80983
18 162009
19 323369
20 646271
21 1216723
22 2592211
23 5184422
24 9733109
25 20739329
26 41467565
27 81559503
28 163649289
29 311481083
30 662667007
31 1325334527
32 2628708543
33 5308871023
34 9627863373

List of values

[1, 3, 5, 9, 23, 39, 79, 158, 281, 741, 1145, 2297, 4495, 10111, 20223, 40446, 80983, 162009, 323369, 646271, 1216723, 2592211, 5184422, 9733109, 20739329, 41467565, 81559503, 163649289, 311481083, 662667007, 1325334527, 2628708543, 5308871023, 9627863373]