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.

A119563 Define F(n) = 2^(2^n)+1 = n-th Fermat number, M(n) = 2^n-1 = the n-th Mersenne number. Then a(n) = F(n)+M(n)-1 = 2^(2^n) + 2^n - 1.

Table of values

n a(n)
0 2
1 5
2 19
3 263
4 65551
5 4294967327
6 18446744073709551679
7 340282366920938463463374607431768211583
8 115792089237316195423570985008687907853269984665640564039457584007913129640191

List of values

[2, 5, 19, 263, 65551, 4294967327, 18446744073709551679, 340282366920938463463374607431768211583, 115792089237316195423570985008687907853269984665640564039457584007913129640191]