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.

Showing 1-2 of 2 results.

A208572 Smallest twin prime > 2^n.

Original entry on oeis.org

3, 5, 11, 17, 41, 71, 137, 269, 521, 1031, 2081, 4127, 8219, 16451, 32801, 65537, 131111, 262151, 524351, 1048889, 2097257, 4194581, 8388617, 16777289, 33554501, 67109321, 134217779, 268435577, 536871017, 1073741831, 2147483867, 4294967387
Offset: 1

Views

Author

Washington Bomfim, Feb 28 2012

Keywords

Examples

			For n=1 the smallest twin prime > 2^n is 3.
		

Crossrefs

Cf. A001359, A208574, A173937 (a(n) - 2^n).

Programs

  • Mathematica
    stp[n_]:=Module[{t=NextPrime[n]},While[!PrimeQ[t+2],t=NextPrime[t]];t]; Table[stp[2^i],{i,40}] (* Harvey P. Dale, Aug 24 2013 *)
  • PARI
    a(n)=my(t=2^n);while(!ispseudoprime(t+2),t=nextprime(t+1));t \\ Charles R Greathouse IV, Jun 21 2012

A208573 Smallest twin prime > 3*2^n.

Original entry on oeis.org

11, 17, 29, 59, 101, 197, 419, 809, 1607, 3119, 6197, 12377, 24917, 49169, 98321, 196661, 393299, 786551, 1572869, 3145739, 6292007, 12582917, 25166129, 50331707, 100663427, 201327011, 402653411, 805306457, 1610613929, 3221225549
Offset: 1

Views

Author

Washington Bomfim, Feb 28 2012

Keywords

Examples

			For n=1 the smallest twin prime > 3*2^n is 11.
		

Crossrefs

Programs

  • Mathematica
    stp[n_]:=Module[{t=NextPrime[3*2^n]},While[!PrimeQ[t+2],t=NextPrime[t]];t]; Array[stp, 30] (* Harvey P. Dale, Sep 12 2015 *)
Showing 1-2 of 2 results.