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.

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

Table of values

n a(n)
1 0
2 2
3 4
4 6
5 9
6 12
7 14
8 17
9 21
10 24
11 27
12 31
13 34
14 38
15 41
16 45
17 49
18 52
19 56
20 60
21 64
22 68
23 72
24 76
25 80
26 84
27 88
28 92
29 96
30 101
31 105
32 109
33 114
34 118
35 122
36 127
37 131
38 135
39 140
40 144
41 149
42 153
43 158
44 162
45 167
46 172
47 176
48 181
49 185
50 190
51 195
52 200
53 204
54 209
55 214
56 218
57 223
58 228
59 233
60 238
61 242
62 247
63 252
64 257
65 262
66 267
67 272
68 277
69 282
70 287

List of values

[0, 2, 4, 6, 9, 12, 14, 17, 21, 24, 27, 31, 34, 38, 41, 45, 49, 52, 56, 60, 64, 68, 72, 76, 80, 84, 88, 92, 96, 101, 105, 109, 114, 118, 122, 127, 131, 135, 140, 144, 149, 153, 158, 162, 167, 172, 176, 181, 185, 190, 195, 200, 204, 209, 214, 218, 223, 228, 233, 238, 242, 247, 252, 257, 262, 267, 272, 277, 282, 287]