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.

A333500 A(n,k) is the n-th number m such that m^2 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 21
19 20
20 0
21 6
22 1
23 5
24 4
25 903
26 220
27 0
28 7
29 1
30 2
31 1555
32 6
33 2667
34 1220
35 0
36 8
37 1
38 7
39 3
40 9673655
41 12
42 7077
43 2420
44 0
45 9
46 1
47 2
48 889
49 4
50 187159211791705
51 42
52 113799
53 5060
54 0
55 10
56 1
57 3
58 4
59 2359
60 6
61 776119592182705
62 52
63 114681
64 13420
65 0
66 11

List of values

[1, 1, 2, 1, 0, 3, 1, 2, 0, 4, 1, 3, 4, 0, 5, 1, 2, 21, 20, 0, 6, 1, 5, 4, 903, 220, 0, 7, 1, 2, 1555, 6, 2667, 1220, 0, 8, 1, 7, 3, 9673655, 12, 7077, 2420, 0, 9, 1, 2, 889, 4, 187159211791705, 42, 113799, 5060, 0, 10, 1, 3, 4, 2359, 6, 776119592182705, 52, 114681, 13420, 0, 11]