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.

A115339 a(2n-1)=F(n+1), a(2n)=L(n), where F(n) and L(n) are the Fibonacci and the Lucas sequences.

Table of values

n a(n)
1 1
2 1
3 2
4 3
5 3
6 4
7 5
8 7
9 8
10 11
11 13
12 18
13 21
14 29
15 34
16 47
17 55
18 76
19 89
20 123
21 144
22 199
23 233
24 322
25 377
26 521
27 610
28 843
29 987
30 1364
31 1597
32 2207
33 2584
34 3571
35 4181
36 5778
37 6765
38 9349
39 10946
40 15127
41 17711
42 24476
43 28657
44 39603
45 46368
46 64079
47 75025
48 103682
49 121393
50 167761

List of values

[1, 1, 2, 3, 3, 4, 5, 7, 8, 11, 13, 18, 21, 29, 34, 47, 55, 76, 89, 123, 144, 199, 233, 322, 377, 521, 610, 843, 987, 1364, 1597, 2207, 2584, 3571, 4181, 5778, 6765, 9349, 10946, 15127, 17711, 24476, 28657, 39603, 46368, 64079, 75025, 103682, 121393, 167761]