login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100804 Smallest prime P such that n*P# -1 and n*P# +1 are twin primes, where P#=primorial P, or 0 if no such prime exists. 0
3, 2, 2, 11, 3, 2, 3, 5, 2, 3, 7, 3, 7, 5, 2, 7, 3, 3, 5, 5, 2, 5, 3, 11, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

No solutions found yet for n={26,39,46,59,63,68,76,81,82,84,89} through prime(1700)=14519. (Ray Chandler, Jan 23, 2005)

The sequence continues: a(26)=?, 5, 7, 7, 2, 19, 3, 3, 5, 5, 2, 19, 3, a(39)=?, 3, 5, 7, 5, 5, 3, a(46)=?, 3, 11, 17, 7, 2, 3, 43, 2, 7, 37, 7, 3, a(59)=?, 151, 31, 13, a(63)=?. - Robert G. Wilson v, Jan 12 2005

LINKS

Table of n, a(n) for n=1..25.

EXAMPLE

For n=4:

4*2=8 8-1=7 prime but 8+1=9=3*3

4*2*3=24 24-1=23 prime but 24+1=25=5*5

4*2*3*5=120 120-1=119=7*17

4*2*3*5*7=840 840-1=839 prime but 840+1=841=29*29

4*2*3*5*7*11=9240 9240-1=9239 prime 9240+1=9241 prime so for n=4 P=11

MATHEMATICA

Primorial[n_] := Product[Prime[i], {i, n}]; f[n_] := Block[{k = 1}, While[p = n*Primorial[k]; !PrimeQ[p - 1]\ || ! PrimeQ[p + 1], k++ ]; Prime[k]]; Table[ f[n], {n, 25}] (from Robert G. Wilson v Jan 12 2005).

CROSSREFS

Cf. A060256.

Sequence in context: A058147 A193344 A119954 * A143175 A074248 A206703

Adjacent sequences:  A100801 A100802 A100803 * A100805 A100806 A100807

KEYWORD

nonn,more

AUTHOR

Pierre CAMI, Jan 04 2005

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 24 09:00 EST 2014. Contains 249873 sequences.