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.

A072939 Define a sequence c depending on n as follows: c(1)=1 and c(2)=n; c(k+2) = (c(k+1) + c(k))/2 if c(k+1) and c(k) have the same parity; otherwise c(k+2) = abs(c(k+1) - 2*c(k)); sequence gives values of n such that lim_{k->oo} c(k) = infinity.

Table of values

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

List of values

[3, 7, 9, 11, 15, 19, 23, 25, 27, 31, 33, 35, 39, 41, 43, 47, 51, 55, 57, 59, 63, 67, 71, 73, 75, 79, 83, 87, 89, 91, 95, 97, 99, 103, 105, 107, 111, 115, 119, 121, 123, 127, 129, 131, 135, 137, 139, 143, 147, 151, 153, 155, 159, 161, 163, 167, 169, 171, 175, 179]