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.

A114977 Numbers k such that (j^k + k^j) == 0 (mod k+j), j=2 case.

Table of values

n a(n)
1 1
2 2
3 8
4 128
5 2144
6 4808
7 12872
8 14168
9 32377
10 33672
11 45992
12 116192
13 185768
14 186824
15 271208
16 426008
17 484177
18 524288
19 601352
20 612768
21 755792
22 996032
23 1878368
24 2262752
25 3094247
26 4325960
27 4810808
28 6331808
29 6707352
30 10037792
31 10908137
32 11475128
33 12672992
34 13705232

List of values

[1, 2, 8, 128, 2144, 4808, 12872, 14168, 32377, 33672, 45992, 116192, 185768, 186824, 271208, 426008, 484177, 524288, 601352, 612768, 755792, 996032, 1878368, 2262752, 3094247, 4325960, 4810808, 6331808, 6707352, 10037792, 10908137, 11475128, 12672992, 13705232]