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.

A060030 a(1) = 1, a(2) = 2; thereafter a "hole" is defined to be any positive number not in the sequence a(1)..a(n-1) and less than the largest term; if there exists at least one hole, then a(n) is the largest hole, otherwise a(n) = a(n-2) + a(n-1).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 4
6 9
7 8
8 7
9 6
10 13
11 12
12 11
13 10
14 21
15 20
16 19
17 18
18 17
19 16
20 15
21 14
22 29
23 28
24 27
25 26
26 25
27 24
28 23
29 22
30 45
31 44
32 43
33 42
34 41
35 40
36 39
37 38
38 37
39 36
40 35
41 34
42 33
43 32
44 31
45 30
46 61
47 60
48 59
49 58
50 57
51 56
52 55
53 54
54 53
55 52
56 51
57 50
58 49
59 48
60 47
61 46
62 93
63 92
64 91
65 90
66 89
67 88
68 87
69 86
70 85
71 84
72 83

List of values

[1, 2, 3, 5, 4, 9, 8, 7, 6, 13, 12, 11, 10, 21, 20, 19, 18, 17, 16, 15, 14, 29, 28, 27, 26, 25, 24, 23, 22, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36, 35, 34, 33, 32, 31, 30, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47, 46, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83]