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.

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

Table of values

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

List of values

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