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.

A327836 Least k > 0 such that n^k == 1 (mod (n+1)^(n+1)).

Table of values

n a(n)
1 1
2 18
3 64
4 1250
5 3888
6 235298
7 2097152
8 86093442
9 250000000
10 51874849202
11 743008370688
12 46596170244962
13 396857386627072
14 58385852050781250
15 1152921504606846976
16 97322383751333736962
17 273238944967337066496
18 208254700595822483065682
19 5242880000000000000000000
20 556436858893903097274392802

List of values

[1, 18, 64, 1250, 3888, 235298, 2097152, 86093442, 250000000, 51874849202, 743008370688, 46596170244962, 396857386627072, 58385852050781250, 1152921504606846976, 97322383751333736962, 273238944967337066496, 208254700595822483065682, 5242880000000000000000000, 556436858893903097274392802]