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.

A088527 Define a Fibonacci-type sequence to be one of the form s(1) = s_1 >= 1, s(2) = s_2 >= 1, s(n+2) = s(n+1) + s(n); then a(n) = maximal m such that n is the m-th term in some Fibonacci-type sequence.

Table of values

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

List of values

[2, 3, 4, 4, 5, 4, 5, 6, 5, 5, 6, 5, 7, 6, 5, 6, 6, 7, 6, 6, 8, 6, 7, 6, 6, 7, 6, 7, 8, 6, 7, 6, 7, 9, 6, 7, 8, 7, 7, 6, 7, 8, 7, 7, 8, 7, 9, 7, 7, 8, 7, 7, 8, 7, 10, 7, 7, 8, 7, 9, 8, 7, 8, 7, 7, 8, 7, 9, 8, 7, 8, 7, 9, 8, 7, 10, 8, 7, 8, 7, 9, 8, 7, 8, 8, 9, 8, 7, 11]

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

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