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.

A025110 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (F(2), F(3), F(4), ...), t = A014306.

Table of values

n a(n)
1 1
2 1
3 2
4 1
5 3
6 6
7 11
8 11
9 18
10 17
11 29
12 27
13 45
14 40
15 66
16 53
17 87
18 142
19 230
20 229
21 372
22 370
23 600
24 595
25 964
26 951
27 1540
28 1506
29 2438
30 2349
31 3802
32 3569
33 5776
34 5165
35 8358
36 6760
37 10939
38 17701
39 28642
40 28634
41 46332
42 46311
43 74934
44 74879
45 121158
46 121014
47 195806
48 195429
49 316212

List of values

[1, 1, 2, 1, 3, 6, 11, 11, 18, 17, 29, 27, 45, 40, 66, 53, 87, 142, 230, 229, 372, 370, 600, 595, 964, 951, 1540, 1506, 2438, 2349, 3802, 3569, 5776, 5165, 8358, 6760, 10939, 17701, 28642, 28634, 46332, 46311, 74934, 74879, 121158, 121014, 195806, 195429, 316212]