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.

A321025 a(n) = sum of a(n-4) and a(n-5), with the lowest possible initial values that will generate a sequence where a(n) is always > a(n-1): 4, 5, 6, 7 and 8.

Table of values

n a(n)
1 4
2 5
3 6
4 7
5 8
6 9
7 11
8 13
9 15
10 17
11 20
12 24
13 28
14 32
15 37
16 44
17 52
18 60
19 69
20 81
21 96
22 112
23 129
24 150
25 177
26 208
27 241
28 279
29 327
30 385
31 449
32 520
33 606
34 712
35 834
36 969
37 1126
38 1318
39 1546
40 1803
41 2095
42 2444
43 2864
44 3349
45 3898
46 4539
47 5308
48 6213
49 7247
50 8437
51 9847
52 11521
53 13460
54 15684

List of values

[4, 5, 6, 7, 8, 9, 11, 13, 15, 17, 20, 24, 28, 32, 37, 44, 52, 60, 69, 81, 96, 112, 129, 150, 177, 208, 241, 279, 327, 385, 449, 520, 606, 712, 834, 969, 1126, 1318, 1546, 1803, 2095, 2444, 2864, 3349, 3898, 4539, 5308, 6213, 7247, 8437, 9847, 11521, 13460, 15684]