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.

A374318 For any n > 0, let b_n(n+1) = 0, and for k = 1..n, if b_n(k+1) >= k then b_n(k) = b_n(k+1) - k otherwise b_n(k) = b_n(k+1) + k; a(n) = b_n(1).

Table of values

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

List of values

[0, 1, 1, 0, 2, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 2, 1, 1, 0, 2, 1, 1, 0, 2, 1, 1, 0, 2, 1, 1, 0, 2, 1, 1, 0, 2, 1, 1, 0, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1, 2, 0, 1, 1]