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.

A249507 Length of full iterated word (direct branch and reverse branch) of the Kolakoski sequence A000002 initiated at A000002(n). If the reverse branch is longer than the direct branch, the total length is counted negatively: if A000002(n) = 2, a(n) = 0; if A000002(n) = 1, a(n) = (ld+lr-1)*sign(ld-lr) with ld = max { k | A000002(n-i+1) = A000002(i), 0 and lr = max { k | A000002(n-i+1) = A000002(i), 0

Table of values

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

List of values

[0, 0, -4, 2, 0, 5, 0, 0, 10, 0, 0, -4, 2, 0, -2, 4, 0, 0, -8, 0, -2, 2, 0, 8, 0, 0, -4, 2, 0, -2, 2, 0, 5, 0, 0, 14, 0, 0, -4, 2, 0, 5, 0, 0, -5, 0, -2, 2, 0, -2, 4, 0, 0, 24, 0, 0, -4, 2, 0, 5, 0, 0, 10, 0, 0, -4, 2, 0, -2, 2, 0, 5, 0, 0, -5, 0, -2, 4, 0, 0, 38, 0, 0, -4, 2, 0, 5]