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.

A011369 a(n+1) = a(n) - F(n) if > 0, otherwise a(n) + F(n), where F() are Fibonacci numbers; a(0) = 0.

Table of values

n a(n)
0 0
1 0
2 1
3 2
4 4
5 1
6 6
7 14
8 1
9 22
10 56
11 1
12 90
13 234
14 1
15 378
16 988
17 1
18 1598
19 4182
20 1
21 6766
22 17712
23 1
24 28658
25 75026
26 1
27 121394
28 317812
29 1
30 514230
31 1346270
32 1
33 2178310
34 5702888
35 1
36 9227466
37 24157818
38 1
39 39088170
40 102334156
41 1
42 165580142
43 433494438
44 1
45 701408734
46 1836311904

List of values

[0, 0, 1, 2, 4, 1, 6, 14, 1, 22, 56, 1, 90, 234, 1, 378, 988, 1, 1598, 4182, 1, 6766, 17712, 1, 28658, 75026, 1, 121394, 317812, 1, 514230, 1346270, 1, 2178310, 5702888, 1, 9227466, 24157818, 1, 39088170, 102334156, 1, 165580142, 433494438, 1, 701408734, 1836311904]