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.

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

Table of values

n a(n)
1 0
2 1
3 2
4 4
5 6
6 8
7 10
8 12
9 15
10 17
11 19
12 22
13 25
14 27
15 30
16 33
17 35
18 38
19 41
20 44
21 47
22 50
23 53
24 56
25 59
26 62
27 65
28 68
29 71
30 75
31 78
32 81
33 84
34 88
35 91
36 94
37 98
38 101
39 104
40 108
41 111
42 114
43 118
44 121
45 125
46 128
47 132
48 135
49 139
50 142
51 146
52 149
53 153
54 157
55 160
56 164
57 167
58 171
59 175
60 178
61 182
62 186
63 189
64 193
65 197
66 201
67 204
68 208
69 212
70 216

List of values

[0, 1, 2, 4, 6, 8, 10, 12, 15, 17, 19, 22, 25, 27, 30, 33, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 65, 68, 71, 75, 78, 81, 84, 88, 91, 94, 98, 101, 104, 108, 111, 114, 118, 121, 125, 128, 132, 135, 139, 142, 146, 149, 153, 157, 160, 164, 167, 171, 175, 178, 182, 186, 189, 193, 197, 201, 204, 208, 212, 216]