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.

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

List of values

[3, 4, 6, 8, 11, 12, 14, 15, 17, 18, 19, 20, 23, 24, 26, 29, 30, 32, 35, 38, 41, 42, 43, 44, 47, 48, 50, 51, 52, 53, 56, 57, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 71, 74, 77, 78, 79, 80, 83, 84, 86, 89, 92, 95, 96, 97, 98, 101, 102, 104, 107, 110, 113, 116, 119, 122, 125, 128]