Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A091415
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A091415 Numbers n such that n!*2^n - 1 is prime. +0
6
2, 3, 4, 8, 13, 32, 41, 45, 59, 97, 107, 364, 421, 444, 1164, 1663, 3202, 4335, 4841, 13528, 22159 (list; graph; listen)
OFFSET

1,1

LINKS

Ken Davis, Status of Search for Multifactorial Primes.

Ken Davis, Results for n!2-1.

FORMULA

a(n) = A007749[n+1]/2, where A007749[n] are the numbers n such that n!!-1 is prime. - Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 23 2006

EXAMPLE

a(1)=2 because 2!*2^2 - 1 = 7 is prime

a(2)=3 because 3!*2^3 - 1 = 47 is prime

MATHEMATICA

For[n=1, n<1000, n++, If[PrimeQ[2^n*n!-1], Print[n]]] (Steinerberger)

PROGRAM

(PARI) f(n)=n!*2^n -1; for (i=1, 363, if(isprime(f(i)), print(i)))

CROSSREFS

A093173 gives the corresponding primes.

Cf. A007749, A117141, A092075.

Adjacent sequences: A091412 A091413 A091414 this_sequence A091416 A091417 A091418

Sequence in context: A126042 A076227 A092075 this_sequence A091816 A100993 A117395

KEYWORD

hard,nonn

AUTHOR

Mohammed Bouayoun (bouyao(AT)wanadoo.fr), Mar 02 2004

EXTENSIONS

a(12)-a(14) from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Feb 05 2006

a(15) from Mohammed Bouayoun (Mohammed.Bouayoun(AT)yahoo.fr), Apr 13 2006

More terms from Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 23 2006

Corrected and extended by Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 03 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research