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.

A246104 Least m > 0 for which (s(m), ..., s(n+m-1)) = (s(0), ..., s(n)), the first n+1 terms of the infinite Fibonacci word A003849.

Table of values

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

List of values

[2, 3, 5, 5, 8, 8, 8, 13, 13, 13, 13, 13, 21, 21, 21, 21, 21, 21, 21, 21, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89]

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

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