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.

A339950 Numbers k such that all k-sections of the infinite Fibonacci word A014675 have just two different run-lengths.

Table of values

n a(n)
1 1
2 7
3 14
4 20
5 27
6 35
7 41
8 48
9 54
10 62
11 69
12 75
13 82
14 90
15 96
16 103
17 109
18 117
19 124
20 130
21 137
22 143
23 151
24 158
25 164
26 171
27 179
28 185
29 192
30 198
31 206
32 213
33 219
34 226
35 234
36 240
37 247
38 253
39 260
40 268
41 274
42 281
43 287
44 295
45 302
46 308
47 315
48 323
49 329
50 336
51 342
52 350
53 357
54 363
55 370
56 376
57 384
58 391
59 397
60 404

List of values

[1, 7, 14, 20, 27, 35, 41, 48, 54, 62, 69, 75, 82, 90, 96, 103, 109, 117, 124, 130, 137, 143, 151, 158, 164, 171, 179, 185, 192, 198, 206, 213, 219, 226, 234, 240, 247, 253, 260, 268, 274, 281, 287, 295, 302, 308, 315, 323, 329, 336, 342, 350, 357, 363, 370, 376, 384, 391, 397, 404]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.