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.

A278452 a(n) = nearest integer to b(n) = c^(b(n-1)/(n-1)), where c = e = 2.71828... and b(1) is chosen such that the sequence neither explodes nor goes to 1.

Table of values

n a(n)
1 1
2 4
3 7
4 11
5 15
6 19
7 23
8 28
9 33
10 37
11 42
12 48
13 53
14 58
15 64
16 69
17 75
18 80
19 86
20 92
21 97
22 103
23 109
24 115
25 121
26 127
27 133
28 139
29 146
30 152
31 158
32 165
33 171
34 177
35 184
36 190
37 197
38 203
39 210
40 216
41 223
42 230
43 236
44 243
45 250
46 256
47 263
48 270
49 277
50 284
51 290
52 297
53 304
54 311
55 318
56 325
57 332
58 339
59 346
60 353
61 360
62 367
63 375
64 382
65 389
66 396
67 403
68 410
69 418
70 425

List of values

[1, 4, 7, 11, 15, 19, 23, 28, 33, 37, 42, 48, 53, 58, 64, 69, 75, 80, 86, 92, 97, 103, 109, 115, 121, 127, 133, 139, 146, 152, 158, 165, 171, 177, 184, 190, 197, 203, 210, 216, 223, 230, 236, 243, 250, 256, 263, 270, 277, 284, 290, 297, 304, 311, 318, 325, 332, 339, 346, 353, 360, 367, 375, 382, 389, 396, 403, 410, 418, 425]