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-3 of 3 results.

A230769 Numbers k such that (k+1)*2^k - 1 is prime.

Original entry on oeis.org

1, 2, 3, 4, 5, 9, 14, 15, 16, 27, 45, 122, 125, 213, 242, 256, 263, 290, 855, 1059, 2273, 3945, 3999, 9512, 14127, 16486, 20056, 28834, 41493, 159147, 227139, 587823
Offset: 1

Views

Author

Zak Seidov, Feb 23 2014

Keywords

Comments

1, 2 and 5 are the only terms of this sequence which are also in A029544. - Gerasimov Sergey, Feb 23 2014
The next term with this property is > 10000. - Michael B. Porter, Feb 23 2014
The probability of a given number N being a twin prime grows like 1/(log(N))^2, so for a given n, the probability that it has this property is 1/n^2, and the sum converges. Are there any n for which n*2^n-1 and n*2^n+1 are both prime? - Michael B. Porter, Feb 25 2014
We can write (k+1)*2^k - 1 = {(k+1)/2}*4^{(k+1)/2} - 1, and when k is odd, this takes the form of a generalized Woodall prime (base 4). These are listed in A086661. In other words, {2*A086661 - 1} gives all the odd terms of this sequence. - Jeppe Stig Nielsen, Oct 16 2019
The largest odd term currently known is 3986381 = 2*A086661(21) - 1. - Jeppe Stig Nielsen, Oct 16 2019

Crossrefs

Programs

Extensions

Edited and extended to values > 2273 by M. F. Hasler, Mar 01 2014
More terms from Jeppe Stig Nielsen, Oct 16 2019

A196273 Primes of the form n*2^(n-1)+1.

Original entry on oeis.org

2, 5, 13, 193, 449, 114689, 1811939329, 2434970217729660813313, 4943727411754159833089, 6731298963614255244763987969, 2388456554926020709124028311441244161
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Sep 29 2011

Keywords

Comments

Generated by n = 1, 2, 3, 6, 7, 14, 27, 66, 67, 87, 115, .. = A029544(n)+1.
See also A236752 for primes of the form k*2^(k-1) - 1, and A230769 for the corresponding indices k (minus 1). - M. F. Hasler, Mar 01 2014

Crossrefs

Cf. A005183.

Programs

  • Mathematica
    Select[Table[n*2^(n-1)+1,{n,150}],PrimeQ] (* Harvey P. Dale, Jul 17 2018 *)
  • PARI
    lista(nn) = {for (n=1, nn, if (isprime(p = n*2^(n-1)+1), print1(p, ", ")););} \\ Michel Marcus, Nov 09 2013

A237251 Primes p such that p*2^(p-1)-1 is prime.

Original entry on oeis.org

2, 3, 5, 17, 257, 16487
Offset: 1

Views

Author

Gerasimov Sergey, Feb 05 2014

Keywords

Comments

The fifth Fermat prime, 65537, is not in the sequence: 65537*2^65536-1 is composite (per PFGW). - Michael B. Porter, Feb 11 2014
Also 65537*2^65536-1 is divisible by 16267 and 2058772459. - Jeppe Stig Nielsen, Jan 04 2020

Crossrefs

Programs

  • PARI
    isok(p) = isprime(p) && isprime(p*2^(p-1) - 1); \\ Michel Marcus, Feb 06 2014

Extensions

a(5) from Ralf Stephan, Feb 03 2014
a(6) = A230769(26)+1 appended by Jeppe Stig Nielsen, Jan 04 2020
Showing 1-3 of 3 results.