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.

A333301 a(1) = 1, a(2) = 2. For n>2, if a(n-1) is odd, a(n) = a(n-1) + a(n-2), and otherwise a(n) is the smallest missing number.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 8
6 4
7 6
8 7
9 13
10 20
11 9
12 29
13 38
14 10
15 11
16 21
17 32
18 12
19 14
20 15
21 29
22 44
23 16
24 17
25 33
26 50
27 18
28 19
29 37
30 56
31 22
32 23
33 45
34 68
35 24
36 25
37 49
38 74
39 26
40 27
41 53
42 80
43 28
44 30
45 31
46 61
47 92
48 34
49 35
50 69
51 104
52 36
53 39
54 75
55 114
56 40
57 41
58 81
59 122
60 42
61 43
62 85
63 128
64 46
65 47
66 93
67 140
68 48
69 51
70 99
71 150
72 52
73 54
74 55
75 109
76 164

List of values

[1, 2, 3, 5, 8, 4, 6, 7, 13, 20, 9, 29, 38, 10, 11, 21, 32, 12, 14, 15, 29, 44, 16, 17, 33, 50, 18, 19, 37, 56, 22, 23, 45, 68, 24, 25, 49, 74, 26, 27, 53, 80, 28, 30, 31, 61, 92, 34, 35, 69, 104, 36, 39, 75, 114, 40, 41, 81, 122, 42, 43, 85, 128, 46, 47, 93, 140, 48, 51, 99, 150, 52, 54, 55, 109, 164]