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.

A024692 a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n+1-k), where k = floor((n+1)/2), s = A023533.

Table of values

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

List of values

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