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.

A100707 a(1) = 1; for n > 1, a(n+1)=a(n)-k if there exists a positive number k (take the smallest) that has not yet been used and is such that a(n+1) is new and >0, otherwise a(n+1) = a(n)+k if the same conditions are satisfied.

Table of values

n a(n)
1 1
2 2
3 4
4 7
5 3
6 8
7 14
8 6
9 13
10 22
11 12
12 23
13 11
14 24
15 10
16 25
17 9
18 26
19 5
20 27
21 45
22 21
23 40
24 20
25 43
26 18
27 44
28 17
29 46
30 16
31 47
32 19
33 51
34 15
35 48
36 82
37 42
38 77
39 39
40 76
41 37
42 78
43 36
44 79
45 35
46 80
47 34
48 81
49 33
50 83
51 32
52 84
53 31
54 85
55 30
56 86
57 29
58 87
59 38
60 97
61 28
62 88
63 149
64 75
65 137
66 74

List of values

[1, 2, 4, 7, 3, 8, 14, 6, 13, 22, 12, 23, 11, 24, 10, 25, 9, 26, 5, 27, 45, 21, 40, 20, 43, 18, 44, 17, 46, 16, 47, 19, 51, 15, 48, 82, 42, 77, 39, 76, 37, 78, 36, 79, 35, 80, 34, 81, 33, 83, 32, 84, 31, 85, 30, 86, 29, 87, 38, 97, 28, 88, 149, 75, 137, 74]