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.

A015134 Consider Fibonacci-type sequences b(0)=X, b(1)=Y, b(k)=b(k-1)+b(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 4
5 3
6 4
7 4
8 8
9 5
10 6
11 14
12 10
13 7
14 8
15 12
16 16
17 9
18 16
19 22
20 16
21 29
22 28
23 12
24 30
25 13
26 14
27 14
28 22
29 63
30 24
31 34
32 32
33 39
34 34
35 30
36 58
37 19
38 86
39 32
40 52
41 43
42 58
43 22
44 78
45 39
46 46
47 70
48 102
49 25
50 26
51 42
52 40
53 27
54 52
55 160
56 74
57 63
58 126
59 62
60 70
61 63
62 134
63 104
64 64
65 57
66 78
67 34
68 132
69 101
70 60
71 74
72 222

List of values

[1, 2, 2, 4, 3, 4, 4, 8, 5, 6, 14, 10, 7, 8, 12, 16, 9, 16, 22, 16, 29, 28, 12, 30, 13, 14, 14, 22, 63, 24, 34, 32, 39, 34, 30, 58, 19, 86, 32, 52, 43, 58, 22, 78, 39, 46, 70, 102, 25, 26, 42, 40, 27, 52, 160, 74, 63, 126, 62, 70, 63, 134, 104, 64, 57, 78, 34, 132, 101, 60, 74, 222]