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.

A201864 a(n) = ((F(n-1)+F(n-2))-1)/2 if F(n) is odd, otherwise a(n) = ((F(n-1)+F(n-2))-2)/2, where F(n) = A000045(n) is the n-th Fibonacci number.

Table of values

n a(n)
1 0
2 0
3 0
4 1
5 2
6 3
7 6
8 10
9 16
10 27
11 44
12 71
13 116
14 188
15 304
16 493
17 798
18 1291
19 2090
20 3382
21 5472
22 8855
23 14328
24 23183
25 37512
26 60696
27 98208
28 158905
29 257114
30 416019
31 673134
32 1089154
33 1762288
34 2851443
35 4613732
36 7465175
37 12078908
38 19544084
39 31622992
40 51167077
41 82790070

List of values

[0, 0, 0, 1, 2, 3, 6, 10, 16, 27, 44, 71, 116, 188, 304, 493, 798, 1291, 2090, 3382, 5472, 8855, 14328, 23183, 37512, 60696, 98208, 158905, 257114, 416019, 673134, 1089154, 1762288, 2851443, 4613732, 7465175, 12078908, 19544084, 31622992, 51167077, 82790070]