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.

A364683 a(n) is the least k such that 1 + 2^k + 3^k is divisible by n, or -1 if there is no such k.

Table of values

n a(n)
1 0
2 1
3 0
4 3
5 -1
6 1
7 2
8 -1
9 3
10 -1
11 9
12 3
13 -1
14 2
15 -1
16 -1
17 9
18 3
19 -1
20 -1
21 -1
22 9
23 5
24 -1
25 -1
26 -1
27 9
28 -1
29 -1
30 -1
31 16
32 -1
33 9
34 9
35 -1
36 3
37 12
38 -1
39 -1
40 -1
41 18
42 -1
43 -1
44 9
45 -1
46 5
47 -1
48 -1
49 4
50 -1
51 9
52 -1
53 -1
54 9
55 -1
56 -1
57 -1
58 -1
59 -1
60 -1
61 -1
62 16
63 -1
64 -1
65 -1
66 9
67 -1
68 9
69 5
70 -1
71 -1
72 -1
73 19
74 12
75 -1
76 -1
77 -1
78 -1
79 33
80 -1
81 27

List of values

[0, 1, 0, 3, -1, 1, 2, -1, 3, -1, 9, 3, -1, 2, -1, -1, 9, 3, -1, -1, -1, 9, 5, -1, -1, -1, 9, -1, -1, -1, 16, -1, 9, 9, -1, 3, 12, -1, -1, -1, 18, -1, -1, 9, -1, 5, -1, -1, 4, -1, 9, -1, -1, 9, -1, -1, -1, -1, -1, -1, -1, 16, -1, -1, -1, 9, -1, 9, 5, -1, -1, -1, 19, 12, -1, -1, -1, -1, 33, -1, 27]