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.

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

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 7
7 8
8 13
9 15
10 16
11 21
12 24
13 29
14 31
15 32
16 34
17 44
18 55
19 56
20 61
21 63
22 64
23 81
24 89
25 108
26 120
27 125
28 127
29 128
30 144
31 149
32 208
33 233
34 236
35 248
36 253
37 255
38 256
39 274
40 377
41 401
42 464
43 492
44 504
45 509
46 511
47 512
48 610
49 773
50 912
51 927
52 976
53 987
54 1004
55 1016
56 1021
57 1023
58 1024

List of values

[1, 2, 3, 4, 5, 7, 8, 13, 15, 16, 21, 24, 29, 31, 32, 34, 44, 55, 56, 61, 63, 64, 81, 89, 108, 120, 125, 127, 128, 144, 149, 208, 233, 236, 248, 253, 255, 256, 274, 377, 401, 464, 492, 504, 509, 511, 512, 610, 773, 912, 927, 976, 987, 1004, 1016, 1021, 1023, 1024]