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.

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

Table of values

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

List of values

[0, 0, 1, 1, 0, 1, 1, 1, 2, 2, 1, 2, 2, 1, 2, 2, 3, 2, 3, 3, 2, 3, 3, 2, 3, 3, 4, 3, 4, 4, 4, 4, 3, 4, 4, 3, 4, 4, 3, 5, 5, 5, 4, 5, 5, 5, 5, 4, 5, 5, 5, 5, 6, 5, 6, 6, 5, 6, 6, 5, 5, 6, 6, 5, 6, 6, 6, 6, 5, 7, 7, 7, 7, 7, 6, 7, 7, 7, 7, 7, 7, 6, 7, 7, 6, 7, 8, 7, 8, 7]