This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A084314 a(n) = x is the smallest number such that gcd(prime(x)+1, x) = n. 3
 1, 2, 3, 4, 35, 24, 63, 56, 45, 10, 649, 132, 91, 42, 495, 48, 153, 54, 779, 700, 1785, 264, 851, 96, 1125, 286, 1647, 672, 551, 570, 341, 448, 2277, 1462, 385, 144, 1369, 418, 2145, 1000, 4797, 294, 817, 1804, 405, 414, 7003, 2016, 11515, 950, 2193, 2444 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Ivan Neretin, Table of n, a(n) for n = 1..4000 FORMULA a(n) = Min{x; A084310(x)=n}. MATHEMATICA f[x_] := GCD[Prime[x]+1, x] t=Table[0, {256}]; Do[s=f[n]; If[s<257&&t[[s]]==0, t[[s]]=n], {n, 1, 100000}]; t Module[{cc=Table[{x, GCD[Prime[x]+1, x]}, {x, 20000}]}, Transpose[Table[ SelectFirst[ cc, #[[2]]==n&], {n, 60}]][[1]]] (* Harvey P. Dale, Nov 28 2014 *) CROSSREFS Cf. A084309-A084316. Sequence in context: A102842 A299169 A009263 * A247961 A294921 A293685 Adjacent sequences:  A084311 A084312 A084313 * A084315 A084316 A084317 KEYWORD nonn AUTHOR Labos Elemer, Jun 13 2003 STATUS approved

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

Last modified January 18 16:40 EST 2019. Contains 319271 sequences. (Running on oeis4.)