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.

A283312 a(n) = smallest missing positive number, unless a(n-1) was a prime in which case a(n) = 2*a(n-1).

Table of values

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

List of values

[1, 2, 4, 3, 6, 5, 10, 7, 14, 8, 9, 11, 22, 12, 13, 26, 15, 16, 17, 34, 18, 19, 38, 20, 21, 23, 46, 24, 25, 27, 28, 29, 58, 30, 31, 62, 32, 33, 35, 36, 37, 74, 39, 40, 41, 82, 42, 43, 86, 44, 45, 47, 94, 48, 49, 50, 51, 52, 53, 106, 54, 55, 56, 57, 59, 118, 60, 61, 122, 63, 64, 65, 66, 67, 134, 68, 69]