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.

A367477 a(n) is the least k such that all possible modular classes a Fibonacci number can take mod n is seen in the Fibonacci numbers Fibonacci(1)..Fibonacci(k).

Table of values

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

List of values

[1, 3, 4, 6, 9, 12, 12, 10, 16, 21, 10, 22, 18, 36, 20, 22, 24, 18, 18, 52, 14, 30, 36, 22, 49, 60, 52, 44, 14, 60, 30, 46, 38, 24, 76, 22, 54, 18, 46, 58, 30, 36, 64, 30, 92, 36, 24, 22, 80, 147, 66, 74, 76, 52, 18, 44, 70, 42, 58, 118, 42, 30, 44, 94, 102, 114, 96]

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

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