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.

A156974 Primes of the form 2^k + 29.

Original entry on oeis.org

31, 37, 61, 157, 541, 8221, 32797, 131101, 8388637, 134217757, 8589934621, 137438953501, 8796093022237, 9223372036854775837, 590295810358705651741, 9444732965739290427421, 604462909807314587353117, 618970019642690137449562141, 166153499473114484112975882535043101, 170141183460469231731687303715884105757, 883423532389192164791648750371459257913741948437809479060803100646309917
Offset: 1

Views

Author

Edwin Dyke (ed.dyke(AT)btinternet.com), Feb 19 2009

Keywords

Crossrefs

Cf. A057733 (2^k+3), A123250 (2^k+5), A104066 (2^k+7), A156940 (2^k+11).

Programs

  • Magma
    [a: n in [0..300] | IsPrime(a) where a is 2^n+29 ]; // Vincenzo Librandi, Nov 27 2010
  • Maple
    a := proc (n) if isprime(2^n+29) = true then 2^n+29 else end if end proc: seq(a(n), n = 1 .. 110); # Emeric Deutsch, Mar 14 2009
  • Mathematica
    Delete[Union[Table[If[PrimeQ[2^n + 29], 2^n + 29, 0], {n, 1, 500}]],1]

Formula

a(n) = 2^A156982(n) + 29. - Elmo R. Oliveira, Nov 08 2023

Extensions

More terms from Emeric Deutsch, Mar 14 2009
More terms from Vincenzo Librandi, Nov 27 2010