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.

A212957 A(n,k) is the number of moduli m such that the multiplicative order of k mod m equals n; square array A(n,k), n>=1, k>=1, read by antidiagonals.

Table of values

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

List of values

[0, 1, 0, 2, 1, 0, 2, 2, 1, 0, 3, 2, 2, 2, 0, 2, 5, 4, 6, 1, 0, 4, 2, 3, 4, 4, 3, 0, 2, 6, 2, 12, 6, 10, 1, 0, 4, 4, 8, 4, 9, 16, 2, 4, 0, 3, 6, 2, 26, 4, 37, 6, 14, 2, 0, 4, 3, 12, 18, 4, 10, 3, 8, 4, 5, 0, 2, 12, 5, 14, 6, 42, 2, 28, 26, 16, 3, 0]