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.

A119561 Define F(n) = 2^(2^n)+1 = the 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)+1+2^n-1+1 = 2^(2^n)+2^n+1 = F(n)+2^n.

Table of values

n a(n)
0 4
1 7
2 21
3 265
4 65553
5 4294967329
6 18446744073709551681
7 340282366920938463463374607431768211585
8 115792089237316195423570985008687907853269984665640564039457584007913129640193

List of values

[4, 7, 21, 265, 65553, 4294967329, 18446744073709551681, 340282366920938463463374607431768211585, 115792089237316195423570985008687907853269984665640564039457584007913129640193]