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!)
 A072562 Smallest of exactly n consecutive integers divisible respectively by the first n primes. 12
 4, 2, 8, 158, 3098, 788, 210998, 5316098, 34415168, 703693778, 194794490678, 5208806743928, 138782093170508, 5006786309605868, 253579251611336438, 12551374903381164638, 142908008812141343558, 77053322014980646906358 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS a(n) often equals A069561(n). For n>2, a(n) == 8 (mod 30). - Robert G. Wilson v, Oct 30 2014 For n<1000 a(n)>a(n+1) when n = 1, 5, 90. - Robert G. Wilson v, Oct 30 2014 LINKS Robert Israel, Table of n, a(n) for n = 1..320 FORMULA If A069561(n+1) = A069561(n), then a(n) = A069561(n) + A002110(n). Otherwise, then a(n) = A069561(n). - David Wasserman, Oct 21 2004 a(n) = A069561(n) or A069561(n) + A002110(n), hence log a(n) << n log n. - Charles R Greathouse IV, Jun 20 2015 EXAMPLE a(4)=158 because 158 is the least number such that 158, 159, 160 and 161 are divisible by 4 consecutive primes, namely 2, 3, 5 and 7 respectively. a(5) does not equal A069561(5)=788 because 788 is the smallest integer in a run of 6 (not 5) consecutive integers that are divisible respectively by the first 6 consecutive primes. - Geoffrey Critzer, Oct 29 2014 MAPLE A:= proc(n) local r; if n = 1 then return 4 fi; r:= chrem([seq(-i, i=0..n-1)], [seq(ithprime(i), i=1..n)]); if r + n mod ithprime(n+1) = 0 then  r + mul(ithprime(i), i=1..n) else r fi end proc: seq(A(n), n=1..50); # Robert Israel, Oct 29 2014 MATHEMATICA f[n_] := Block[{p = Prime@ Range@ n}, r = ChineseRemainder[-Range@ n + 1, p]; If[ Mod[r + n, Prime[n + 1]] == 0, r + Times @@ p, r]]; f[1] = 4; Array[f, 20] (* Robert G. Wilson v, Oct 30 2014 *) PROG (PARI) a(n)=if(n==1, return(4)); my(m=chinese(vector(n, k, Mod(1-k, prime(k)))), p=prime(n+1), t=lift(m)); if((t+n)%p, t, t+m.mod) \\ Charles R Greathouse IV, Jun 20 2015 CROSSREFS Cf. A073606, A073607, A072555, A069561. Sequence in context: A040174 A084477 A046589 * A190477 A143311 A016696 Adjacent sequences:  A072559 A072560 A072561 * A072563 A072564 A072565 KEYWORD nonn AUTHOR Robert G. Wilson v, Aug 06 2002 EXTENSIONS More terms from David Wasserman, Oct 21 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 June 4 01:05 EDT 2020. Contains 334808 sequences. (Running on oeis4.)