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.

A296240 Pisano quotients: a(n) = (p-1)/k(p) if p == +- 1 mod 5, = (2*p+2)/k(p) if p == +- 2 mod 5, where p = prime(n) and k(p) = Pisano period(p).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 9, 5, 1, 1, 2, 9, 1, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 7, 1, 1, 1, 3, 1, 3, 2, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 5, 1, 1, 1, 1, 1, 1, 10, 1, 1, 1, 1, 1, 1, 1, 2, 20, 1, 6, 1, 9, 3, 1, 1, 1, 1, 1, 1]