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.

A080725 a(1) = 2; for n>1, 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)
1 2
2 4
3 5
4 7
5 10
6 11
7 13
8 14
9 15
10 16
11 19
12 20
13 22
14 25
15 28
16 31
17 32
18 33
19 34
20 37
21 38
22 40
23 41
24 42
25 43
26 44
27 45
28 46
29 47
30 48
31 49
32 52
33 55
34 58
35 59
36 60
37 61
38 64
39 65
40 67
41 70
42 73
43 76
44 79
45 82
46 85
47 88
48 91
49 94
50 95
51 96
52 97
53 98
54 99
55 100
56 101
57 102
58 103
59 106
60 109
61 112
62 113
63 114
64 115
65 118
66 119
67 121

List of values

[2, 4, 5, 7, 10, 11, 13, 14, 15, 16, 19, 20, 22, 25, 28, 31, 32, 33, 34, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 52, 55, 58, 59, 60, 61, 64, 65, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 106, 109, 112, 113, 114, 115, 118, 119, 121]