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.

A333429 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 3
6 0
7 1
8 2
9 9
10 0
11 1
12 5
13 10
14 27
15 0
16 1
17 2
18 25
19 50
20 81
21 0
22 1
23 7
24 3
25 125
26 250
27 171
28 0
29 1
30 2
31 49
32 9
33 205
34 1250
35 243
36 0
37 1
38 3
39 10
40 203
41 21
42 625
43 5050
44 513
45 0
46 1
47 2
48 9
49 50
50 343
51 26
52 1025
53 6250
54 729
55 0
56 1
57 11
58 5
59 27
60 250
61 1379
62 27
63 2525
64 11810
65 1539
66 0

List of values

[1, 1, 2, 1, 3, 0, 1, 2, 9, 0, 1, 5, 10, 27, 0, 1, 2, 25, 50, 81, 0, 1, 7, 3, 125, 250, 171, 0, 1, 2, 49, 9, 205, 1250, 243, 0, 1, 3, 10, 203, 21, 625, 5050, 513, 0, 1, 2, 9, 50, 343, 26, 1025, 6250, 729, 0, 1, 11, 5, 27, 250, 1379, 27, 2525, 11810, 1539, 0]