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.

A080727 a(0) = 1; 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) == 2 mod 3".

Table of values

n a(n)
0 1
1 2
2 5
3 6
4 7
5 8
6 11
7 14
8 17
9 18
10 19
11 20
12 21
13 22
14 23
15 24
16 25
17 26
18 29
19 32
20 35
21 38
22 41
23 44
24 47
25 50
26 53
27 54
28 55
29 56
30 57
31 58
32 59
33 60
34 61
35 62
36 63
37 64
38 65
39 66
40 67
41 68
42 69
43 70
44 71
45 72
46 73
47 74
48 75
49 76
50 77
51 78
52 79
53 80
54 83
55 86
56 89
57 92
58 95
59 98
60 101
61 104
62 107
63 110
64 113
65 116
66 119
67 122

List of values

[1, 2, 5, 6, 7, 8, 11, 14, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 83, 86, 89, 92, 95, 98, 101, 104, 107, 110, 113, 116, 119, 122]