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.

A293394 Numbers k such that (2*k-1)*(2^((k-1)/4)) == 1 (mod k).

Original entry on oeis.org

1, 17, 41, 97, 137, 193, 241, 313, 401, 409, 433, 449, 457, 521, 569, 641, 673, 761, 769, 809, 857, 929, 953, 977, 1009, 1129, 1297, 1321, 1361, 1409, 1489, 1657, 1697, 1873, 1993, 2017, 2081, 2137, 2153, 2161
Offset: 1

Views

Author

Jonas Kaiser, Nov 09 2017

Keywords

Comments

It appears that many elements of this sequence are prime. The first "pseudoprime" in this sequence is 74665.

Crossrefs

Programs