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.

A089990 a(n) = n step nested walk based on (A004001[n]+ (-1)^lastsum).

Table of values

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

List of values

[1, 0, 2, 2, 0, 3, 1, 1, 0, 3, 1, 1, 1, 0, 4, 4, 4, 4, 4, 0, 5, 3, 3, 3, 3, 3, 0, 5, 3, 3, 3, 3, 3, 3, 0, 5, 3, 3, 3, 3, 3, 3, 3, 0, 6, 6, 6, 6, 6, 6, 6, 6, 6, 0, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 0, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 0, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 0, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 0, 9]