The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A103356 a(n) is the least k such that k*((prime(n)#)^2)-1 is prime, where prime(n)# is the n-th primorial. 0
1, 2, 3, 3, 6, 2, 13, 13, 5, 6, 2, 11, 14, 15, 3, 7, 77, 6, 20, 41, 52, 6, 13, 8, 41, 52, 24, 26, 31, 41, 6, 31, 21, 28, 43, 57, 11, 18, 47, 19, 8, 33, 24, 30, 43, 10, 17, 213, 29, 15, 45, 60, 50, 26, 48, 18, 18, 78, 8, 59, 13, 33, 145, 23, 154, 79, 65, 21, 18, 23, 30, 19, 159, 46, 45 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
1*2^2-1 = 3 prime, so a(1) = 1.
1*((2*3)^2)-1 = 35 is composite, 2*((2*3)^2)-1 = 71 is prime, so a(2) = 2.
1*((2*3*5)^2)-1 = 899 is composite, 2*((2*3*5)^2)-1 = 1799 is composite, 3*((2*3*5)^2)-1 = 2699 is prime, so a(3) = 3.
MATHEMATICA
a[n_] := Module[{k = 1, s = Product[Prime[i], {i, 1, n}]^2}, While[!PrimeQ[k*s-1], k++]; k]; Array[a, 75] (* Amiram Eldar, Jul 18 2021 *)
CROSSREFS
Cf. A002110.
Sequence in context: A323713 A054892 A104570 * A345385 A071915 A182578
KEYWORD
nonn
AUTHOR
Pierre CAMI, Mar 20 2005
EXTENSIONS
Data corrected by Amiram Eldar, Jul 18 2021
STATUS
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 May 15 20:08 EDT 2024. Contains 372549 sequences. (Running on oeis4.)