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.

A080030 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 1 mod 3".

Table of values

n a(n)
0 2
1 1
2 4
3 5
4 7
5 10
6 8
7 13
8 16
9 11
10 19
11 22
12 14
13 25
14 28
15 17
16 31
17 34
18 20
19 37
20 40
21 23
22 43
23 46
24 26
25 49
26 52
27 29
28 55
29 58
30 32
31 61
32 64
33 35
34 67
35 70
36 38
37 73
38 76
39 41
40 79
41 82
42 44
43 85
44 88
45 47
46 91
47 94
48 50
49 97
50 100
51 53
52 103
53 106
54 56
55 109
56 112
57 59
58 115
59 118
60 62
61 121
62 124
63 65
64 127
65 130
66 68

List of values

[2, 1, 4, 5, 7, 10, 8, 13, 16, 11, 19, 22, 14, 25, 28, 17, 31, 34, 20, 37, 40, 23, 43, 46, 26, 49, 52, 29, 55, 58, 32, 61, 64, 35, 67, 70, 38, 73, 76, 41, 79, 82, 44, 85, 88, 47, 91, 94, 50, 97, 100, 53, 103, 106, 56, 109, 112, 59, 115, 118, 62, 121, 124, 65, 127, 130, 68]