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.

A335214 Divide the biggest term of the pair [a(n), a(n+1)] by the smallest one and keep the remainder; the successive remainders of the successive pairs rebuild the starting sequence, digit after digit. This is the lexicographically earliest sequence of distinct positive terms with this property.

Table of values

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

List of values

[10, 3, 6, 9, 15, 24, 23, 18, 8, 12, 5, 13, 14, 22, 30, 29, 27, 11, 34, 31, 17, 19, 21, 45, 90, 44, 35, 33, 26, 25, 4, 7, 32, 63, 46, 47, 38, 36, 37, 41, 87, 39, 78, 74, 70, 67, 62, 59, 28, 54, 52, 57, 53, 60, 92, 43, 20, 16, 86, 82, 75, 72, 64, 61, 55, 58, 51, 106, 88, 81, 42, 49, 155, 148, 48, 103, 206, 40, 127, 65]