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.

A270741 a(n) = (Fibonacci(n+2)-1) mod Fibonacci(floor(n/2)).

Table of values

n a(n)
2 0
3 0
4 0
5 0
6 0
7 1
8 0
9 1
10 3
11 2
12 0
13 1
14 11
15 10
16 0
17 1
18 32
19 31
20 0
21 1
22 87
23 86
24 0
25 1
26 231
27 230
28 0
29 1
30 608
31 607
32 0
33 1
34 1595
35 1594
36 0
37 1
38 4179
39 4178
40 0
41 1
42 10944
43 10943
44 0
45 1
46 28655
47 28654
48 0
49 1
50 75023
51 75022
52 0
53 1
54 196416
55 196415
56 0
57 1
58 514227
59 514226
60 0
61 1
62 1346267
63 1346266
64 0
65 1
66 3524576
67 3524575
68 0
69 1

List of values

[0, 0, 0, 0, 0, 1, 0, 1, 3, 2, 0, 1, 11, 10, 0, 1, 32, 31, 0, 1, 87, 86, 0, 1, 231, 230, 0, 1, 608, 607, 0, 1, 1595, 1594, 0, 1, 4179, 4178, 0, 1, 10944, 10943, 0, 1, 28655, 28654, 0, 1, 75023, 75022, 0, 1, 196416, 196415, 0, 1, 514227, 514226, 0, 1, 1346267, 1346266, 0, 1, 3524576, 3524575, 0, 1]