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.

A080029 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 a multiple of 3".

Table of values

n a(n)
0 0
1 2
2 3
3 6
4 5
5 9
6 12
7 8
8 15
9 18
10 11
11 21
12 24
13 14
14 27
15 30
16 17
17 33
18 36
19 20
20 39
21 42
22 23
23 45
24 48
25 26
26 51
27 54
28 29
29 57
30 60
31 32
32 63
33 66
34 35
35 69
36 72
37 38
38 75
39 78
40 41
41 81
42 84
43 44
44 87
45 90
46 47
47 93
48 96
49 50
50 99
51 102
52 53
53 105
54 108
55 56
56 111
57 114
58 59
59 117
60 120
61 62
62 123
63 126
64 65
65 129
66 132
67 68

List of values

[0, 2, 3, 6, 5, 9, 12, 8, 15, 18, 11, 21, 24, 14, 27, 30, 17, 33, 36, 20, 39, 42, 23, 45, 48, 26, 51, 54, 29, 57, 60, 32, 63, 66, 35, 69, 72, 38, 75, 78, 41, 81, 84, 44, 87, 90, 47, 93, 96, 50, 99, 102, 53, 105, 108, 56, 111, 114, 59, 117, 120, 62, 123, 126, 65, 129, 132, 68]