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.

A127208 Union of all n-step Lucas sequences, that is, all sequences s(1-n) = s(2-n) = ... = s(-1) = -1, s(0) = n and for k > 0, s(k) = s(k-1) + ... + s(k-n).

Table of values

n a(n)
1 1
2 3
3 4
4 7
5 11
6 15
7 18
8 21
9 26
10 29
11 31
12 39
13 47
14 51
15 57
16 63
17 71
18 76
19 99
20 113
21 120
22 123
23 127
24 131
25 191
26 199
27 223
28 239
29 241
30 247
31 255
32 322
33 367
34 439
35 443
36 475
37 493
38 502
39 511
40 521
41 708
42 815
43 843
44 863
45 943
46 983
47 1003
48 1013
49 1023
50 1364
51 1365
52 1499
53 1695
54 1871
55 1959

List of values

[1, 3, 4, 7, 11, 15, 18, 21, 26, 29, 31, 39, 47, 51, 57, 63, 71, 76, 99, 113, 120, 123, 127, 131, 191, 199, 223, 239, 241, 247, 255, 322, 367, 439, 443, 475, 493, 502, 511, 521, 708, 815, 843, 863, 943, 983, 1003, 1013, 1023, 1364, 1365, 1499, 1695, 1871, 1959]