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.

A080711 a(0) = 2; for n>0, a(n) is taken to be the smallest positive integer greater than a(n-1) which is consistent with the condition "n is a member of the sequence if and only if a(n) is a multiple of 3".

Table of values

n a(n)
0 2
1 4
2 6
3 7
4 9
5 10
6 12
7 15
8 16
9 18
10 21
11 22
12 24
13 25
14 26
15 27
16 30
17 31
18 33
19 34
20 35
21 36
22 39
23 40
24 42
25 45
26 48
27 51
28 52
29 53
30 54
31 57
32 58
33 60
34 63
35 66
36 69
37 70
38 71
39 72
40 75
41 76
42 78
43 79
44 80
45 81
46 82
47 83
48 84
49 85
50 86
51 87
52 90
53 93
54 96
55 97
56 98
57 99
58 102
59 103
60 105
61 106
62 107
63 108
64 109
65 110
66 111
67 112

List of values

[2, 4, 6, 7, 9, 10, 12, 15, 16, 18, 21, 22, 24, 25, 26, 27, 30, 31, 33, 34, 35, 36, 39, 40, 42, 45, 48, 51, 52, 53, 54, 57, 58, 60, 63, 66, 69, 70, 71, 72, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 90, 93, 96, 97, 98, 99, 102, 103, 105, 106, 107, 108, 109, 110, 111, 112]