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.

A015135 Consider Fibonacci-type sequences f(0)=X, f(1)=Y, f(k)=f(k-1)+f(k-2) mod n; all are periodic; sequence gives number of distinct periods.

Table of values

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

List of values

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