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.

A024879 a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ], s = A023531.

Table of values

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

List of values

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