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.

A288572 a(n) = smallest positive integer k such that (n^3)^k == 1 mod (n+1)^3.

Table of values

n a(n)
1 1
2 6
3 16
4 50
5 6
6 98
7 64
8 54
9 50
10 242
11 48
12 338
13 98
14 150
15 256
16 578
17 54
18 722
19 400
20 294
21 242
22 1058
23 192
24 1250
25 338
26 486
27 784
28 1682
29 150
30 1922
31 1024
32 726
33 578
34 2450
35 432
36 2738
37 722
38 1014
39 1600
40 3362
41 294
42 3698
43 1936
44 1350
45 1058
46 4418
47 768
48 4802
49 1250
50 1734
51 2704
52 5618
53 486
54 6050
55 3136
56 2166
57 1682
58 6962

List of values

[1, 6, 16, 50, 6, 98, 64, 54, 50, 242, 48, 338, 98, 150, 256, 578, 54, 722, 400, 294, 242, 1058, 192, 1250, 338, 486, 784, 1682, 150, 1922, 1024, 726, 578, 2450, 432, 2738, 722, 1014, 1600, 3362, 294, 3698, 1936, 1350, 1058, 4418, 768, 4802, 1250, 1734, 2704, 5618, 486, 6050, 3136, 2166, 1682, 6962]