The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080373 a(n) is the smallest number such that GCD of n values of prime(j)-1 for successive j values is greater than 2, where prime(j)=j-th prime. 0
 0, 6, 24, 77, 271, 271, 1395, 1395, 1395, 13717, 34369, 172146, 172146, 804584, 804584, 804584 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS FORMULA a(n) = Min{x; gcd[prime(x)-1, ..., prime(x+n-1)]>2}, where prime()=A000040(). EXAMPLE n=2: a(2)=6=A067605(2); n=3: a(3)=24 means: firstly occurs that for three consecutive p-1 terms GCD[prime(24)-1, prime(25)-1, prime(26)-1] = GCD[88, 96, 100] = 4 > 2; CROSSREFS Cf. A058263, A067605. Sequence in context: A225383 A257956 A341364 * A180437 A276179 A162583 Adjacent sequences:  A080370 A080371 A080372 * A080374 A080375 A080376 KEYWORD nonn,more AUTHOR Labos Elemer, Feb 26 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 2 09:32 EDT 2022. Contains 354999 sequences. (Running on oeis4.)