A175866 Numbers k such that 2^(k-1) == 1 (mod k) and 2^(k-1) == 3*k + 1 (mod k^2).
5, 13, 19, 173, 5501
Offset: 1
Crossrefs
Cf. A124924.
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.