The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097455 a(n) = gcd(prime(n)+1, composite(n)). 1
 1, 4, 6, 8, 3, 2, 6, 2, 3, 2, 2, 2, 21, 22, 24, 1, 2, 1, 4, 6, 2, 1, 2, 5, 2, 2, 13, 4, 2, 2, 1, 2, 6, 7, 50, 1, 2, 2, 1, 2, 3, 2, 12, 2, 9, 8, 1, 2, 4, 23, 2, 24, 2, 3, 2, 11, 6, 16, 1, 2, 4, 1, 2, 3, 2, 6, 1, 2, 3, 2, 1, 24, 2, 11, 20, 6, 26, 1, 2, 2, 10, 1, 16, 2, 5, 4, 9, 2, 7, 8, 1, 2, 1, 4, 125 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..1000 MATHEMATICA Module[{nn=100, prs, cmps}, prs=Prime[Range[nn]]; cmps=Take[Complement[ Range[ Prime[nn]], prs], nn]; GCD@@@Thread[{prs+1, cmps}]] (* Harvey P. Dale, Sep 05 2013 *) PROG (PARI) primecompgcd(n) = { for(x=1, n, y=gcd(prime(x)+1, composite(x)); print1(y", ") ) } \ the n-th composite composite(n) = { local(c, x); c=1; x=0; while(c <= n, x++; if(!isprime(x), c++); ); return(x) } CROSSREFS Cf. A000040, A002808. Sequence in context: A217296 A330154 A179371 * A201520 A179022 A021685 Adjacent sequences:  A097452 A097453 A097454 * A097456 A097457 A097458 KEYWORD nonn AUTHOR Cino Hilliard, Aug 23 2004 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 October 27 09:08 EDT 2020. Contains 338035 sequences. (Running on oeis4.)