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.

A080633 a(1)=3; for n > 1, a(n) is the smallest integer greater than a(n-1) consistent with the condition "n is in the sequence if and only if a(n) is congruent to 1 (mod 4)".

Table of values

n a(n)
1 3
2 4
3 5
4 9
5 13
6 14
7 15
8 16
9 17
10 18
11 19
12 20
13 21
14 25
15 29
16 33
17 37
18 41
19 45
20 49
21 53
22 54
23 55
24 56
25 57
26 58
27 59
28 60
29 61
30 62
31 63
32 64
33 65
34 66
35 67
36 68
37 69
38 70
39 71
40 72
41 73
42 74
43 75
44 76
45 77
46 78
47 79
48 80
49 81
50 82
51 83
52 84
53 85
54 89
55 93
56 97
57 101
58 105
59 109
60 113
61 117
62 121
63 125
64 129
65 133
66 137
67 141

List of values

[3, 4, 5, 9, 13, 14, 15, 16, 17, 18, 19, 20, 21, 25, 29, 33, 37, 41, 45, 49, 53, 54, 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, 83, 84, 85, 89, 93, 97, 101, 105, 109, 113, 117, 121, 125, 129, 133, 137, 141]