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.

A360260 a(0) = 0, and for any n > 0, let k > 0 be as small as possible and such that T(3) + ... + T(2+k) >= n (where T(m) denotes A000073(m), the m-th tribonacci number); a(n) = k + a(T(3) + ... + T(2+k) - n).

Table of values

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

List of values

[0, 1, 3, 2, 5, 6, 4, 3, 8, 10, 9, 6, 7, 5, 4, 12, 11, 14, 15, 13, 8, 9, 11, 10, 7, 8, 6, 5, 16, 17, 15, 14, 19, 21, 20, 17, 18, 10, 11, 13, 12, 15, 16, 14, 9, 10, 12, 11, 8, 9, 7, 6, 21, 23, 22, 19, 20, 18, 17, 25, 24, 27, 28, 26, 21, 22, 24, 23, 12, 13, 15]