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.

A114978 Numbers k such that (j^k + k^j) == 0 (mod k+j), j=3 case.

Table of values

n a(n)
1 1
2 3
3 5
4 6
5 7
6 8
7 9
8 15
9 21
10 24
11 27
12 33
13 36
14 39
15 51
16 63
17 69
18 75
19 81
20 87
21 99
22 105
23 111
24 114
25 118
26 123
27 135
28 153
29 165
30 171
31 183
32 207
33 213
34 219
35 231
36 243
37 249
38 255
39 267
40 279
41 309
42 315
43 348
44 351
45 363
46 375
47 387
48 393
49 399
50 423
51 435
52 453
53 465
54 471
55 495
56 501

List of values

[1, 3, 5, 6, 7, 8, 9, 15, 21, 24, 27, 33, 36, 39, 51, 63, 69, 75, 81, 87, 99, 105, 111, 114, 118, 123, 135, 153, 165, 171, 183, 207, 213, 219, 231, 243, 249, 255, 267, 279, 309, 315, 348, 351, 363, 375, 387, 393, 399, 423, 435, 453, 465, 471, 495, 501]