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.

A114980 Numbers k such that (j^k + k^j) == 0 (mod k+j), j=5 case.

Table of values

n a(n)
1 1
2 3
3 5
4 7
5 14
6 15
7 19
8 20
9 21
10 23
11 25
12 26
13 35
14 45
15 50
16 55
17 65
18 73
19 95
20 105
21 115
22 119
23 120
24 125
25 145
26 165
27 185
28 195
29 215
30 225
31 245
32 270
33 275
34 285
35 295
36 305
37 325
38 350
39 365
40 385
41 405
42 425
43 435
44 437
45 465
46 495
47 525
48 527
49 545
50 585
51 595
52 605
53 620
54 621
55 645

List of values

[1, 3, 5, 7, 14, 15, 19, 20, 21, 23, 25, 26, 35, 45, 50, 55, 65, 73, 95, 105, 115, 119, 120, 125, 145, 165, 185, 195, 215, 225, 245, 270, 275, 285, 295, 305, 325, 350, 365, 385, 405, 425, 435, 437, 465, 495, 525, 527, 545, 585, 595, 605, 620, 621, 645]