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.

A079259 a(n) is taken to be the smallest positive integer greater than a(n-1) such that the condition "n is in the sequence if and only if a(n) and a(n+1) are both odd" can be satisfied.

Table of values

n a(n)
1 1
2 5
3 6
4 10
5 11
6 15
7 19
8 20
9 24
10 25
11 29
12 33
13 34
14 38
15 39
16 43
17 44
18 48
19 49
20 53
21 57
22 58
23 62
24 63
25 67
26 71
27 72
28 76
29 77
30 81
31 82
32 86
33 87
34 91
35 95
36 96
37 100
38 101
39 105
40 109
41 110
42 114
43 115
44 119
45 123
46 124
47 128
48 129
49 133
50 137
51 138
52 142
53 143
54 147
55 148
56 152
57 153
58 157
59 161
60 162
61 166
62 167
63 171
64 175
65 176
66 180
67 181
68 185
69 186
70 190
71 191
72 195
73 199
74 200
75 204

List of values

[1, 5, 6, 10, 11, 15, 19, 20, 24, 25, 29, 33, 34, 38, 39, 43, 44, 48, 49, 53, 57, 58, 62, 63, 67, 71, 72, 76, 77, 81, 82, 86, 87, 91, 95, 96, 100, 101, 105, 109, 110, 114, 115, 119, 123, 124, 128, 129, 133, 137, 138, 142, 143, 147, 148, 152, 153, 157, 161, 162, 166, 167, 171, 175, 176, 180, 181, 185, 186, 190, 191, 195, 199, 200, 204]