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.

A060510 Alternating with hexagonal stutters: if n is hexagonal (2k^2 - k, i.e., A000384) then a(n)=a(n-1), otherwise a(n) = 1 - a(n-1).

Table of values

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

List of values

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