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.

A119564 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 3
2 13
3 249
4 65521
5 4294967265
6 18446744073709551553
7 340282366920938463463374607431768211329
8 115792089237316195423570985008687907853269984665640564039457584007913129639681

List of values

[2, 3, 13, 249, 65521, 4294967265, 18446744073709551553, 340282366920938463463374607431768211329, 115792089237316195423570985008687907853269984665640564039457584007913129639681]