[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A127936 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A127936 Numbers n such that 1 + Sum_{i=1..n} 2^(2i-1) is prime.
(history; published version)
#27 by Harvey P. Dale at Wed Mar 23 14:40:20 EDT 2022
STATUS

editing

approved

#26 by Harvey P. Dale at Wed Mar 23 14:40:17 EDT 2022
MATHEMATICA

Position[Accumulate[2^(2*Range[1000]-1)], _?(PrimeQ[#+1]&)]//Flatten (* The program generates the first 21 terms of the sequence. To generate more, increase the Range constant. *). *) (* _Harvey P. Dale_, Mar 23 2022 *)

STATUS

approved

editing

#25 by Harvey P. Dale at Wed Mar 23 14:39:30 EDT 2022
STATUS

editing

approved

#24 by Harvey P. Dale at Wed Mar 23 14:39:26 EDT 2022
MATHEMATICA

Position[Accumulate[2^(2*Range[1000]-1)], _?(PrimeQ[#+1]&)]//Flatten (* The program generates the first 21 terms of the sequence. To generate more, increase the Range constant. *)

STATUS

approved

editing

#23 by N. J. A. Sloane at Mon Sep 24 16:53:14 EDT 2018
EXTENSIONS

Edited by N. J. A. Sloane at the suggestion of _Andrew S. Plewe_, Jun 11 2007

Discussion
Mon Sep 24 16:53
OEIS Server: https://oeis.org/edit/global/2767
#22 by Bruno Berselli at Wed Sep 16 06:13:38 EDT 2015
STATUS

reviewed

approved

#21 by Michel Marcus at Wed Sep 16 05:59:11 EDT 2015
STATUS

proposed

reviewed

#20 by Jon E. Schoenfield at Wed Sep 16 05:56:37 EDT 2015
STATUS

editing

proposed

#19 by Jon E. Schoenfield at Wed Sep 16 05:56:35 EDT 2015
NAME

Numbers n such that 1 + Sum_{i=1..n} [} 2^(2i-1)] ) is prime.

COMMENTS

Terms beyond a(30) correspond to probable primes, cf. A000978. [From _. - _M. F. Hasler_, Aug 29 2008]

FORMULA

a(n) = floor[ (A000978(n)/2 ] = ceil( ) = ceiling(log[(4]()(A000979(n))) ; ))); A000978(n) = 2 a(n) + 1 ; ; A000979(n) = (2*4^a(n)+1)/3. [From _. - _M. F. Hasler_, Aug 29 2008]

PROG

(PARI) for(n=1, 999, ispseudoprime(2^(2*n+1)\3+1) & print1(n", ")) \ [From _", ")) \\ _M. F. Hasler_, Aug 29 2008]

EXTENSIONS

Edited by N. J. A. Sloane at the suggestion of _Andrew Plewe, _, Jun 11 2007

STATUS

approved

editing

#18 by N. J. A. Sloane at Sat Sep 06 00:47:22 EDT 2014
STATUS

proposed

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 00:57 EDT 2024. Contains 375520 sequences. (Running on oeis4.)