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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A103784 Minimal n that makes primorial P(k)*n-1 prime, k>=2, n>0. 0
1, 1, 2, 1, 1, 2, 2, 3, 6, 3, 2, 1, 18, 3, 7, 13, 11, 24, 2, 13, 2, 16, 1, 4, 29, 6, 18, 4, 2, 11, 14, 13, 38, 13, 14, 9, 17, 12, 13, 10, 31, 19, 5, 58, 5, 15, 22, 18, 8, 5, 11, 27, 24, 13, 10, 11, 3, 36, 18, 19, 13, 16, 12, 3, 1, 53, 1, 11, 19, 15, 81, 14, 28, 7, 5, 57, 40, 40, 46, 6, 10 (list; graph; refs; listen; history; internal format)
OFFSET

2,3

COMMENTS

Minimal n of sequence A103783. Weak conjecture: sequence is defined for all k>=2; strong conjecture: a(k)<=(prime(k))^2;

EXAMPLE

P(2)*1-1=5 is prime, so a(2)=1;

P(9)*3-1=669278609 is prime, so a(9)=3;

MATHEMATICA

nmax = 2^2048; npd = 2; n = 2; npd = npd*Prime[n]; While[npd < nmax, tt = 1; cp = npd*tt - 1; While[(tt <= (Prime[n])^2) && (! (PrimeQ[cp])), tt = tt + 1; cp = npd*tt - 1]; If[tt >= (Prime[n])^2, cp = -cp; tn1 = -tt, tn1 = tt]; Print[tn1]; n = n + 1; npd = npd*Prime[n]]

CROSSREFS

Cf. A002110, A103515, A103783.

Sequence in context: A119985 A181885 A116560 * A153916 A045870 A036863

Adjacent sequences:  A103781 A103782 A103783 * A103785 A103786 A103787

KEYWORD

nonn

AUTHOR

Lei Zhou (lzhou5(AT)emory.edu), Feb 15 2005

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

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

Last modified February 15 19:15 EST 2012. Contains 205852 sequences.