A204927 - cp's OEIS frontend

A204927 The number s(j) such that n divides s(k)-s(j), where s(j) is the (j+1)-st Fibonacci number and k is the least positive integer for which such a j>0 exists.

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

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

cp's OEIS Frontend

A204927 The number s(j) such that n divides s(k)-s(j), where s(j) is the (j+1)-st Fibonacci number and k is the least positive integer for which such a j>0 exists.

Table of values

List of values