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.

Previous Showing 11-13 of 13 results.

A088110 Numbers n such that 2^n + n and 2^n - n are noncomposite.

Original entry on oeis.org

0, 1, 3, 9
Offset: 1

Views

Author

Amarnath Murthy, Sep 25 2003

Keywords

Comments

Conjecture: sequence is finite.
No more terms < 88075. - David Wasserman, Jul 20 2005

Examples

			9 is a member as 2^9 + 9 = 521 and 2^9 - 9 = 503 are primes.
		

Crossrefs

Programs

  • Magma
    [0,1] cat [n: n in [0..1000] | IsPrime(2^n+n) and IsPrime(2^n-n)]; // Vincenzo Librandi, Dec 08 2015
  • Mathematica
    Join[{0, 1}, Select[Range[1000], PrimeQ[2^# + #] && PrimeQ[2^# -#] &]] (* Vincenzo Librandi, Dec 08 2015 *)

A224506 Numbers k such that 9^k - k is prime.

Original entry on oeis.org

2, 70, 88, 6562, 9100, 11758, 34334, 39212, 120590
Offset: 1

Views

Author

Alex Ratushnyak, Apr 08 2013

Keywords

Comments

a(7) > 20000. - Giovanni Resta, Apr 09 2013
a(10) > 2*10^5. - Robert Price, Mar 12 2014

Crossrefs

Programs

Extensions

a(6) from Giovanni Resta, Apr 09 2013
a(7)-a(9) from Robert Price, Mar 12 2014

A295111 Primes p such that 2^p - p is also a prime.

Original entry on oeis.org

2, 3, 13, 19, 481801
Offset: 1

Views

Author

Iain Fox, Nov 14 2017

Keywords

Comments

a(6) > 1061095.
Intersection of A000040 and A048744.
Since numbers other than 3 that are congruent to 3 mod 6 are composite, for n > 2, a(n) is congruent to 1 mod 6 (see comments by Iain Fox in A048744).

Examples

			p=13, 2^13 - 13 = 8179 is prime.
		

Crossrefs

Programs

  • PARI
    lista(nn) = forprime(p=2, nn, if(ispseudoprime(2^p - p), print1(p, ", ")))
Previous Showing 11-13 of 13 results.