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.

A178931 This sequence S is generated by the following rules: 2 is in S, and if n is in S, then floor[(3n-1)/2] and 3n are in S.

Table of values

n a(n)
1 2
2 6
3 8
4 11
5 16
6 18
7 23
8 24
9 26
10 33
11 34
12 35
13 38
14 48
15 49
16 50
17 52
18 54
19 56
20 69
21 71
22 72
23 73
24 74
25 77
26 78
27 80
28 83
29 99
30 102
31 103
32 105
33 106
34 107
35 109
36 110
37 114
38 115
39 116
40 119
41 124
42 144
43 147
44 148
45 150
46 152
47 154
48 156
49 157
50 158
51 160
52 162
53 163
54 164
55 168
56 170
57 172
58 173
59 178
60 185

List of values

[2, 6, 8, 11, 16, 18, 23, 24, 26, 33, 34, 35, 38, 48, 49, 50, 52, 54, 56, 69, 71, 72, 73, 74, 77, 78, 80, 83, 99, 102, 103, 105, 106, 107, 109, 110, 114, 115, 116, 119, 124, 144, 147, 148, 150, 152, 154, 156, 157, 158, 160, 162, 163, 164, 168, 170, 172, 173, 178, 185]