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.

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

Table of values

n a(n)
0 1
1 4
2 5
3 6
4 7
5 10
6 13
7 16
8 17
9 18
10 19
11 20
12 21
13 22
14 23
15 24
16 25
17 28
18 31
19 34
20 37
21 40
22 43
23 46
24 49
25 52
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 82
54 85
55 88
56 91
57 94
58 97
59 100
60 103
61 106
62 109
63 112
64 115
65 118
66 121
67 124

List of values

[1, 4, 5, 6, 7, 10, 13, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 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, 82, 85, 88, 91, 94, 97, 100, 103, 106, 109, 112, 115, 118, 121, 124]