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.

A118966 a(n) = (n+1)/2 if n occurs among the first n-1 terms of the sequence, otherwise a(n) = 2*n - 1.

Table of values

n a(n)
1 1
2 3
3 2
4 7
5 9
6 11
7 4
8 15
9 5
10 19
11 6
12 23
13 25
14 27
15 8
16 31
17 33
18 35
19 10
20 39
21 41
22 43
23 12
24 47
25 13
26 51
27 14
28 55
29 57
30 59
31 16
32 63
33 17
34 67
35 18
36 71
37 73
38 75
39 20
40 79
41 21
42 83
43 22
44 87
45 89
46 91
47 24
48 95
49 97
50 99
51 26
52 103
53 105
54 107
55 28
56 111
57 29
58 115
59 30
60 119
61 121
62 123
63 32
64 127
65 129
66 131
67 34
68 135

List of values

[1, 3, 2, 7, 9, 11, 4, 15, 5, 19, 6, 23, 25, 27, 8, 31, 33, 35, 10, 39, 41, 43, 12, 47, 13, 51, 14, 55, 57, 59, 16, 63, 17, 67, 18, 71, 73, 75, 20, 79, 21, 83, 22, 87, 89, 91, 24, 95, 97, 99, 26, 103, 105, 107, 28, 111, 29, 115, 30, 119, 121, 123, 32, 127, 129, 131, 34, 135]