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.

A080724 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) == 1 mod 3".

Table of values

n a(n)
0 2
1 3
2 4
3 7
4 10
5 11
6 12
7 13
8 14
9 15
10 16
11 19
12 22
13 25
14 28
15 31
16 34
17 35
18 36
19 37
20 38
21 39
22 40
23 41
24 42
25 43
26 44
27 45
28 46
29 47
30 48
31 49
32 50
33 51
34 52
35 55
36 58
37 61
38 64
39 67
40 70
41 73
42 76
43 79
44 82
45 85
46 88
47 91
48 94
49 97
50 100
51 103
52 106
53 107
54 108
55 109
56 110
57 111
58 112
59 113
60 114
61 115
62 116
63 117
64 118
65 119

List of values

[2, 3, 4, 7, 10, 11, 12, 13, 14, 15, 16, 19, 22, 25, 28, 31, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97, 100, 103, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119]