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.

A333432 A(n,k) is the n-th number m that divides k^m - 1 (or 0 if m does not exist); square array A(n,k), n>=1, k>=1, read by antidiagonals.

Table of values

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

List of values

[1, 1, 2, 1, 0, 3, 1, 2, 0, 4, 1, 3, 4, 0, 5, 1, 2, 9, 8, 0, 6, 1, 5, 4, 21, 16, 0, 7, 1, 2, 25, 6, 27, 20, 0, 8, 1, 7, 3, 125, 8, 63, 32, 0, 9, 1, 2, 49, 4, 625, 12, 81, 40, 0, 10, 1, 3, 4, 343, 6, 1555, 16, 147, 64, 0, 11, 1, 2, 9, 8, 889, 8, 3125, 18, 171, 80, 0, 12]