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.

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

Table of values

n a(n)
1 3
2 7
3 13
4 19
5 25
6 32
7 39
8 46
9 53
10 61
11 69
12 77
13 85
14 93
15 102
16 110
17 119
18 128
19 136
20 145
21 154
22 163
23 173
24 182
25 191
26 201
27 210
28 220
29 229
30 239
31 248
32 258
33 268
34 278
35 288
36 298
37 307
38 318
39 328
40 338
41 348
42 358
43 368
44 379
45 389
46 399
47 410
48 420
49 430
50 441
51 451
52 462
53 473
54 483
55 494
56 505
57 515
58 526
59 537
60 547
61 558
62 569
63 580
64 591
65 602
66 613
67 624
68 635
69 646
70 657

List of values

[3, 7, 13, 19, 25, 32, 39, 46, 53, 61, 69, 77, 85, 93, 102, 110, 119, 128, 136, 145, 154, 163, 173, 182, 191, 201, 210, 220, 229, 239, 248, 258, 268, 278, 288, 298, 307, 318, 328, 338, 348, 358, 368, 379, 389, 399, 410, 420, 430, 441, 451, 462, 473, 483, 494, 505, 515, 526, 537, 547, 558, 569, 580, 591, 602, 613, 624, 635, 646, 657]