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.

A362896 a(0)=2. For n>0, let d = n-th digit in the sequence thus far. a(n) = a(n-1) + d if d is even. Otherwise, a(n) = a(n-1) - d.

Table of values

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

List of values

[2, 4, 8, 16, 15, 21, 20, 15, 17, 16, 18, 18, 17, 12, 11, 4, 3, 9, 8, 16, 15, 23, 22, 15, 14, 16, 15, 14, 18, 15, 6, 14, 13, 19, 18, 13, 15, 12, 14, 16, 15, 10, 9, 13, 12, 18, 17, 12, 11, 15, 14, 22, 21, 16, 22, 21, 25, 24, 21, 20, 11, 10, 18, 17, 14, 13, 8, 7]