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.

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

Table of values

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

List of values

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