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.

A341456 Let T be the set of sequences {t(k), k >= 0} such that for any k >= 3, t(k) = t(k-1) + t(k-2) + t(k-3); a(n) is the least possible value of t(0) + t(1) + t(2) for an element t of T containing n.

Table of values

n a(n)
0 0
1 1
2 1
3 1
4 1
5 2
6 1
7 1
8 2
9 3
10 2
11 1
12 2
13 1
14 2
15 3
16 3
17 3
18 2
19 3
20 1
21 3
22 2
23 4
24 1
25 3
26 2
27 3
28 4
29 3
30 5
31 3
32 4
33 2
34 4
35 3
36 4
37 1
38 4
39 3
40 2
41 5
42 4
43 5
44 1
45 5
46 3
47 5
48 2
49 5
50 3
51 5
52 4
53 3
54 6
55 5
56 6
57 3
58 6
59 4
60 3
61 2
62 6
63 4
64 3
65 5
66 4
67 7
68 1
69 7
70 4
71 7
72 3
73 4
74 2
75 7
76 5
77 4
78 6
79 5
80 4
81 1
82 8
83 5
84 4
85 3
86 5

List of values

[0, 1, 1, 1, 1, 2, 1, 1, 2, 3, 2, 1, 2, 1, 2, 3, 3, 3, 2, 3, 1, 3, 2, 4, 1, 3, 2, 3, 4, 3, 5, 3, 4, 2, 4, 3, 4, 1, 4, 3, 2, 5, 4, 5, 1, 5, 3, 5, 2, 5, 3, 5, 4, 3, 6, 5, 6, 3, 6, 4, 3, 2, 6, 4, 3, 5, 4, 7, 1, 7, 4, 7, 3, 4, 2, 7, 5, 4, 6, 5, 4, 1, 8, 5, 4, 3, 5]