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.

A000916 a(2n) = n+2, a(2n-1) = smallest number requiring n+2 letters in English.

Table of values

n a(n)
1 1
2 3
3 4
4 4
5 3
6 5
7 11
8 6
9 15
10 7
11 13
12 8
13 17
14 9
15 24
16 10
17 23
18 11
19 73
20 12
21 3000
22 13
23 11000
24 14
25 15000
26 15
27 101
28 16
29 104
30 17
31 103
32 18
33 111
34 19
35 115
36 20
37 113
38 21
39 117
40 22
41 124
42 23
43 123
44 24
45 173
46 25
47 323
48 26
49 373
50 27
51 1104
52 28
53 1103
54 29
55 1111
56 30

List of values

[1, 3, 4, 4, 3, 5, 11, 6, 15, 7, 13, 8, 17, 9, 24, 10, 23, 11, 73, 12, 3000, 13, 11000, 14, 15000, 15, 101, 16, 104, 17, 103, 18, 111, 19, 115, 20, 113, 21, 117, 22, 124, 23, 123, 24, 173, 25, 323, 26, 373, 27, 1104, 28, 1103, 29, 1111, 30]