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.

A198259 a(n) = Sum_{k=1..n} F(n mod k) where F = A000045, the Fibonacci numbers.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 3
6 2
7 6
8 5
9 9
10 9
11 17
12 13
13 26
14 26
15 39
16 39
17 66
18 61
19 104
20 102
21 156
22 162
23 265
24 249
25 405
26 419
27 646
28 652
29 1059
30 1031
31 1676
32 1696
33 2660
34 2705
35 4362
36 4283
37 6937
38 7039
39 11159
40 11206
41 18138
42 17998
43 29130
44 29325
45 46805
46 47075
47 76171
48 75713
49 122502
50 123123

List of values

[0, 0, 1, 1, 3, 2, 6, 5, 9, 9, 17, 13, 26, 26, 39, 39, 66, 61, 104, 102, 156, 162, 265, 249, 405, 419, 646, 652, 1059, 1031, 1676, 1696, 2660, 2705, 4362, 4283, 6937, 7039, 11159, 11206, 18138, 17998, 29130, 29325, 46805, 47075, 76171, 75713, 122502, 123123]