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.

A341474 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)^2 + t(1)^2 + t(2)^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 4
9 3
10 2
11 1
12 4
13 1
14 4
15 5
16 5
17 3
18 2
19 5
20 1
21 6
22 4
23 6
24 1
25 5
26 4
27 5
28 9
29 5
30 9
31 3
32 10
33 2
34 10
35 5
36 8
37 1
38 6
39 9
40 4
41 17
42 6
43 13
44 1
45 11
46 5
47 13
48 4
49 9
50 5
51 9
52 16
53 5
54 18
55 9
56 14
57 3
58 14
59 10
60 9
61 2
62 12
63 10
64 5
65 21
66 8
67 19
68 1
69 17
70 6
71 19
72 9
73 10
74 4
75 17
76 17
77 6
78 26
79 13

List of values

[0, 1, 1, 1, 1, 2, 1, 1, 4, 3, 2, 1, 4, 1, 4, 5, 5, 3, 2, 5, 1, 6, 4, 6, 1, 5, 4, 5, 9, 5, 9, 3, 10, 2, 10, 5, 8, 1, 6, 9, 4, 17, 6, 13, 1, 11, 5, 13, 4, 9, 5, 9, 16, 5, 18, 9, 14, 3, 14, 10, 9, 2, 12, 10, 5, 21, 8, 19, 1, 17, 6, 19, 9, 10, 4, 17, 17, 6, 26, 13]