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.

A110935 a(n) = if n mod 2 = 0 then 8*F(n)-n otherwise 8*F(n)-4, where F() = Fibonacci numbers A000045.

Table of values

n a(n)
0 0
1 4
2 6
3 12
4 20
5 36
6 58
7 100
8 160
9 268
10 430
11 708
12 1140
13 1860
14 3002
15 4876
16 7880
17 12772
18 20654
19 33444
20 54100
21 87564
22 141666
23 229252
24 370920
25 600196
26 971118
27 1571340
28 2542460
29 4113828
30 6656290
31 10770148
32 17426440
33 28196620
34 45623062
35 73819716
36 119442780
37 193262532

List of values

[0, 4, 6, 12, 20, 36, 58, 100, 160, 268, 430, 708, 1140, 1860, 3002, 4876, 7880, 12772, 20654, 33444, 54100, 87564, 141666, 229252, 370920, 600196, 971118, 1571340, 2542460, 4113828, 6656290, 10770148, 17426440, 28196620, 45623062, 73819716, 119442780, 193262532]