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.

A286343 For n>0, let b(n) = greatest index of n in any Fibonacci-like sequence containing n. This sequence is the ordinal transform of b.

Table of values

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

List of values

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