The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A098090 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A098090

Numbers k such that 2k-3 is prime.
(history; published version)

#54 by Joerg Arndt at Sun Feb 04 01:17:59 EST 2024

STATUS

editing

approved

#53 by Paolo P. Lava at Sat Feb 03 07:54:29 EST 2024

COMMENTS

Solutions of the equation (2*n-3)'=1, where n' is the arithmetic derivative of n. - Paolo P. Lava, Nov 27 2012

STATUS

approved

editing

#52 by Charles R Greathouse IV at Thu Sep 08 08:45:14 EDT 2022

PROG

(MAGMAMagma) [ n: n in [1..200] | IsPrime(2*n-3) ]; // Vincenzo Librandi, Dec 26 2010

Discussion

Thu Sep 08

08:45

OEIS Server: https://oeis.org/edit/global/2944

#51 by Harvey P. Dale at Sat Mar 05 13:00:44 EST 2022

STATUS

editing

approved

#50 by Harvey P. Dale at Sat Mar 05 13:00:41 EST 2022

MATHEMATICA

Select[Range[200], PrimeQ[2#-3]&] (* Harvey P. Dale, Mar 05 2022 *)

STATUS

approved

editing

#49 by Sean A. Irvine at Tue May 21 17:55:25 EDT 2019

STATUS

proposed

approved

#48 by G. C. Greubel at Tue May 21 17:31:33 EDT 2019

STATUS

editing

proposed

#47 by G. C. Greubel at Tue May 21 17:31:25 EDT 2019

PROG

(PARI) is(n)=isprime(2*n-3) \\ Charles R Greathouse IV, Feb 17 2017(Sage) [n for n in (1..200) if is_prime(2*n-3) ] # _G. C. Greubel_, May 21 2019

(Sage) [n for n in (1..200) if is_prime(2*n-3) ] # G. C. Greubel, May 21 2019

#46 by G. C. Greubel at Tue May 21 17:31:08 EDT 2019

FORMULA

Half of p + 3 , where p is a prime greater than 2.

PROG

(PARI) is(n)=isprime(2*n-3) \\ Charles R Greathouse IV, Feb 17 2017(Sage) [n for n in (1..200) if is_prime(2*n-3) ] # _G. C. Greubel_, May 21 2019

(GAP) Filtered([1..200], k-> IsPrime(2*k-3) ) # G. C. Greubel, May 21 2019

STATUS

approved

editing

#45 by Michel Marcus at Sun Nov 04 04:40:04 EST 2018

STATUS

reviewed

approved