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.

A080031 a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 2 mod 3".

Table of values

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

List of values

[1, 2, 5, 4, 8, 11, 7, 14, 17, 10, 20, 23, 13, 26, 29, 16, 32, 35, 19, 38, 41, 22, 44, 47, 25, 50, 53, 28, 56, 59, 31, 62, 65, 34, 68, 71, 37, 74, 77, 40, 80, 83, 43, 86, 89, 46, 92, 95, 49, 98, 101, 52, 104, 107, 55, 110, 113, 58, 116, 119, 61, 122, 125, 64, 128, 131, 67]