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.

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

Table of values

n a(n)
1 0
2 1
3 3
4 5
5 7
6 9
7 11
8 14
9 17
10 19
11 22
12 25
13 28
14 31
15 34
16 37
17 40
18 43
19 46
20 49
21 52
22 56
23 59
24 62
25 66
26 69
27 73
28 76
29 80
30 83
31 87
32 90
33 94
34 98
35 101
36 105
37 109
38 112
39 116
40 120
41 123
42 127
43 131
44 135
45 139
46 143
47 146
48 150
49 154
50 158
51 162
52 166
53 170
54 174
55 178
56 182
57 186
58 190
59 194
60 198
61 202
62 206
63 210
64 214
65 218
66 222
67 226
68 231
69 235
70 239

List of values

[0, 1, 3, 5, 7, 9, 11, 14, 17, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 56, 59, 62, 66, 69, 73, 76, 80, 83, 87, 90, 94, 98, 101, 105, 109, 112, 116, 120, 123, 127, 131, 135, 139, 143, 146, 150, 154, 158, 162, 166, 170, 174, 178, 182, 186, 190, 194, 198, 202, 206, 210, 214, 218, 222, 226, 231, 235, 239]