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.

A114979 Numbers n such that (j^k + k^j) == 0 (mod k+j), j=4 case.

Table of values

n a(n)
1 1
2 4
3 12
4 25
5 28
6 30
7 60
8 61
9 109
10 124
11 252
12 478
13 529
14 1024
15 3273
16 6172
17 14881
18 24700
19 28732
20 29701
21 32509
22 41437
23 47569
24 70009
25 83209
26 86629
27 88177
28 99712
29 131161
30 161473
31 172092
32 224389
33 280869
34 281509
35 419017
36 640129
37 691840
38 704089
39 983641
40 1048588

List of values

[1, 4, 12, 25, 28, 30, 60, 61, 109, 124, 252, 478, 529, 1024, 3273, 6172, 14881, 24700, 28732, 29701, 32509, 41437, 47569, 70009, 83209, 86629, 88177, 99712, 131161, 161473, 172092, 224389, 280869, 281509, 419017, 640129, 691840, 704089, 983641, 1048588]