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.

A024375 a(n) = s(1)*t(n) + s(2)*t(n-1) + ... + s(k)*t(n+1-k), where k = floor((n+1)/2), s = A023532, t = A023533.

Table of values

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

List of values

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