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.

A114981 Numbers k such that (j^k + k^j) == 0 (mod k+j), j=6 case.

Table of values

n a(n)
1 1
2 3
3 6
4 10
5 12
6 15
7 18
8 21
9 26
10 30
11 42
12 48
13 57
14 58
15 62
16 66
17 68
18 71
19 72
20 75
21 87
22 90
23 102
24 138
25 156
26 183
27 186
28 210
29 216
30 228
31 237
32 273
33 282
34 291
35 318
36 426
37 476
38 480
39 561
40 570
41 576
42 606
43 642
44 645
45 660
46 696
47 701
48 723
49 831
50 858
51 951
52 966
53 1290
54 1306
55 1452

List of values

[1, 3, 6, 10, 12, 15, 18, 21, 26, 30, 42, 48, 57, 58, 62, 66, 68, 71, 72, 75, 87, 90, 102, 138, 156, 183, 186, 210, 216, 228, 237, 273, 282, 291, 318, 426, 476, 480, 561, 570, 576, 606, 642, 645, 660, 696, 701, 723, 831, 858, 951, 966, 1290, 1306, 1452]