This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066752 a(n) = GCD(prime(n)+1, n+1). 3
 1, 1, 2, 1, 6, 7, 2, 1, 2, 1, 4, 1, 14, 1, 16, 1, 6, 1, 4, 3, 2, 1, 12, 5, 2, 3, 4, 1, 10, 1, 32, 33, 2, 35, 6, 1, 2, 1, 8, 1, 6, 1, 4, 1, 2, 1, 4, 7, 2, 1, 26, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 21, 4, 13, 2, 1, 4, 1, 2, 1, 6, 1, 2, 1, 76, 1, 78, 1, 2, 1, 2, 1, 12, 1, 2, 3, 2, 1, 6, 1, 4, 3, 2, 1, 4, 1, 2, 9, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Harry J. Smith, Table of n, a(n) for n=1,...,1000 EXAMPLE a(23) = GCD(prime(23)+1,23+1) = GCD(83+1,24) = GCD(84,24) = 12*GCD(7,2) = 12. MATHEMATICA Table[GCD[Prime[w]+1, w+1], {w, 1, 128}] PROG (PARI) { for (n=1, 1000, write("b066752.txt", n, " ", gcd(prime(n) + 1, n + 1)) ) } [From Harry J. Smith, Mar 22 2010] CROSSREFS Cf. A000040. Cf. A084309-A084316. Sequence in context: A052636 A172430 A084312 * A192329 A059364 A217922 Adjacent sequences:  A066749 A066750 A066751 * A066753 A066754 A066755 KEYWORD nonn AUTHOR Reinhard Zumkeller, Jan 16, 2002 EXTENSIONS More terms from Labos E. (labos(AT)ana.sote.hu), Jun 13 2003 STATUS approved

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 .