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.

A384148 Numbers k such that (2^k-1)^k == 1 (mod (2^k+1)*k^2) and 2^(k-1) != 1 (mod k).

Table of values

n a(n)
1 30457
2 33865
3 80185
4 82621
5 86785
6 104845
7 212401
8 250705

List of values

[30457, 33865, 80185, 82621, 86785, 104845, 212401, 250705]