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.

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

Table of values

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

List of values

[0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 1, 1, 1, 0, 0, 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, 2, 1, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1]