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.

A025066 a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = A023532.

Table of values

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

List of values

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