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.

A080722 a(0) = 0; 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 term of the sequence if and only if a(n) == 1 (mod 3)".

Table of values

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

List of values

[0, 1, 3, 4, 7, 8, 9, 10, 13, 16, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 31, 34, 37, 40, 43, 46, 49, 52, 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, 81, 82, 85, 88, 91, 94, 97, 100, 103, 106, 109, 112, 115, 118, 121]