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.

A080034 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 3 mod 4".

Table of values

n a(n)
0 1
1 3
2 4
3 7
4 11
5 6
6 15
7 19
8 9
9 23
10 12
11 27
12 31
13 14
14 35
15 39
16 17
17 43
18 20
19 47
20 51
21 22
22 55
23 59
24 25
25 63
26 28
27 67
28 71
29 30
30 75
31 79
32 33
33 83
34 36
35 87
36 91
37 38
38 95
39 99
40 41
41 103
42 44
43 107
44 111
45 46
46 115
47 119
48 49
49 123
50 52
51 127
52 131
53 54
54 135
55 139
56 57
57 143
58 60
59 147
60 151
61 62
62 155
63 159
64 65
65 163

List of values

[1, 3, 4, 7, 11, 6, 15, 19, 9, 23, 12, 27, 31, 14, 35, 39, 17, 43, 20, 47, 51, 22, 55, 59, 25, 63, 28, 67, 71, 30, 75, 79, 33, 83, 36, 87, 91, 38, 95, 99, 41, 103, 44, 107, 111, 46, 115, 119, 49, 123, 52, 127, 131, 54, 135, 139, 57, 143, 60, 147, 151, 62, 155, 159, 65, 163]