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.

A293626 Numbers of the form (2^(2p) + 1)/5, where p is a prime > 5.

Original entry on oeis.org

3277, 838861, 13421773, 3435973837, 54975581389, 14073748835533, 57646075230342349, 922337203685477581, 3777893186295716170957, 967140655691703339764941, 15474250491067253436239053, 3961408125713216879677197517, 16225927682921336339157801028813
Offset: 1

Views

Author

Amiram Eldar, Oct 13 2017

Keywords

Comments

Rotkiewicz proved that all the terms in this sequence are Fermat pseudoprimes to base 2 (A001567).

Examples

			3277 = (2^(2*7) + 1)/5 is the first term, corresponding to the prime p = 7.
		

Crossrefs

Programs

  • Mathematica
    p = Select[Range[7,60], PrimeQ]; (2^(2p) + 1)/5