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.

A024376 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = A014306.

Table of values

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

List of values

[0, 1, 1, 0, 2, 1, 2, 3, 3, 2, 4, 3, 4, 5, 5, 5, 5, 6, 6, 6, 8, 7, 8, 9, 9, 9, 9, 10, 10, 10, 11, 11, 13, 12, 12, 13, 13, 13, 15, 14, 15, 15, 17, 16, 17, 17, 18, 19, 19, 19, 20, 20, 20, 21, 21, 20, 22, 21, 22, 23, 24, 23, 24, 25, 25, 25, 26, 26, 28, 27, 28, 28, 29, 29, 31, 30, 31, 31, 32, 32, 33, 34, 34, 33]