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.

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

Table of values

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

List of values

[0, 1, 1, 0, 1, 1, 1, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 2, 3, 4, 4, 4, 4, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 4, 3, 4, 4, 3, 4, 4, 4, 4, 4, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 4, 5, 5, 5, 5, 5, 5, 5, 5, 4, 5, 5, 4, 5, 5, 4]