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.

A025087 s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (Fibonacci numbers), t = A014306.

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 2
6 4
7 7
8 7
9 11
10 11
11 18
12 17
13 28
14 25
15 41
16 33
17 54
18 88
19 142
20 142
21 230
22 229
23 371
24 368
25 596
26 588
27 952
28 931
29 1507
30 1452
31 2350
32 2206
33 3570
34 3192
35 5166
36 4178
37 6761
38 10940
39 17702
40 17697
41 28635
42 28622
43 46312
44 46278
45 74880
46 74791
47 121015
48 120782
49 195430
50 194820
51 315226

List of values

[1, 1, 1, 1, 2, 4, 7, 7, 11, 11, 18, 17, 28, 25, 41, 33, 54, 88, 142, 142, 230, 229, 371, 368, 596, 588, 952, 931, 1507, 1452, 2350, 2206, 3570, 3192, 5166, 4178, 6761, 10940, 17702, 17697, 28635, 28622, 46312, 46278, 74880, 74791, 121015, 120782, 195430, 194820, 315226]