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.

A232357 The number of pairs of numbers below n that, when generating a Fibonacci-like sequence modulo n, do not contain zero.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 4
6 0
7 0
8 24
9 0
10 16
11 20
12 48
13 84
14 0
15 36
16 120
17 144
18 144
19 36
20 64
21 288
22 80
23 0
24 360
25 104
26 336
27 0
28 288
29 448
30 144
31 60
32 504
33 580
34 864
35 196
36 912
37 684
38 792
39 756
40 760
41 880
42 1152
43 0
44 920
45 324
46 1056
47 1472
48 1800
49 0
50 416
51 1296
52 1344
53 1404
54 1440
55 2504
56 2040
57 1620
58 1792
59 116
60 1584
61 2820
62 2040
63 2880

List of values

[0, 0, 0, 0, 4, 0, 0, 24, 0, 16, 20, 48, 84, 0, 36, 120, 144, 144, 36, 64, 288, 80, 0, 360, 104, 336, 0, 288, 448, 144, 60, 504, 580, 864, 196, 912, 684, 792, 756, 760, 880, 1152, 0, 920, 324, 1056, 1472, 1800, 0, 416, 1296, 1344, 1404, 1440, 2504, 2040, 1620, 1792, 116, 1584, 2820, 2040, 2880]