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.

A307532 a(n) is the smallest k > 2^(2^n)+1 such that 2^(k-1) == 1 (mod (2^(2^n)-1)*k).

Table of values

n a(n)
0 5
1 7
2 29
3 281
4 65617
5 4294967681
6 18446744073709552577
7 340282366920938463463374607431768211841
8 115792089237316195423570985008687907853269984665640564039457584007913129642241

List of values

[5, 7, 29, 281, 65617, 4294967681, 18446744073709552577, 340282366920938463463374607431768211841, 115792089237316195423570985008687907853269984665640564039457584007913129642241]