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.

A189767 Least number k such that the set of numbers {Fibonacci(i) mod n, i=0..k-1} contains all possible residues of Fibonacci(i) mod n.

Table of values

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

List of values

[1, 2, 4, 5, 10, 10, 13, 11, 17, 22, 9, 23, 19, 37, 20, 23, 25, 19, 17, 53, 15, 25, 37, 23, 50, 61, 53, 45, 13, 58, 29, 47, 39, 25, 77, 23, 55, 17, 47, 59, 31, 37, 65, 29, 93, 37, 25, 23, 81, 148, 67, 75, 77, 53, 19, 45, 71, 37, 57, 119, 43, 29, 45, 95, 103]

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

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