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.

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

Table of values

n a(n)
1 1
2 3
3 6
4 9
5 13
6 16
7 20
8 24
9 29
10 33
11 37
12 42
13 47
14 51
15 56
16 61
17 66
18 71
19 76
20 81
21 86
22 92
23 97
24 102
25 108
26 113
27 118
28 124
29 129
30 135
31 141
32 146
33 152
34 158
35 163
36 169
37 175
38 181
39 187
40 193
41 199
42 205
43 210
44 216
45 222
46 229
47 235
48 241
49 247
50 253
51 259
52 265
53 271
54 278
55 284
56 290
57 296
58 303
59 309
60 315
61 322
62 328
63 334
64 341
65 347
66 354
67 360
68 367
69 373
70 379

List of values

[1, 3, 6, 9, 13, 16, 20, 24, 29, 33, 37, 42, 47, 51, 56, 61, 66, 71, 76, 81, 86, 92, 97, 102, 108, 113, 118, 124, 129, 135, 141, 146, 152, 158, 163, 169, 175, 181, 187, 193, 199, 205, 210, 216, 222, 229, 235, 241, 247, 253, 259, 265, 271, 278, 284, 290, 296, 303, 309, 315, 322, 328, 334, 341, 347, 354, 360, 367, 373, 379]