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.

A015908 Smallest odd k>n such that k | n^k + n, or 0 if n=2^m.

Table of values

n a(n)
0 1
1 0
2 0
3 15
4 0
5 1565
6 111
7 35
8 0
9 123
10 365
11 671
12 15
13 185653
14 259
15 85
16 0
17 4369
18 39
19 247
20 800005
21 39
22 55
23 115
24 1731
25 85
26 221
27 135
28 35
29 105821
30 51
31 403
32 0
33 55
34 1649
35 1939
36 3177
37 3293
38 95
39 2283
40 3845
41 697
42 357
43 215
44 143
45 153
46 667
47 235
48 435
49 511
50 485

List of values

[1, 0, 0, 15, 0, 1565, 111, 35, 0, 123, 365, 671, 15, 185653, 259, 85, 0, 4369, 39, 247, 800005, 39, 55, 115, 1731, 85, 221, 135, 35, 105821, 51, 403, 0, 55, 1649, 1939, 3177, 3293, 95, 2283, 3845, 697, 357, 215, 143, 153, 667, 235, 435, 511, 485]