login
a(n) = { Smallest prime > k } - k, where k = lcm(1..n).
1

%I #12 Mar 19 2018 05:41:56

%S 1,1,1,1,1,1,1,1,13,1,1,13,13,31,31,31,23,19,19,1,1,1,1,41,41,1,1,31,

%T 31,43,43,1,41,41,41,41,41,53,53,53,53,79,79,59,59,59,59,1,1,59,59,59,

%U 59,61,61,61,61,61,61,113,113,97,97,97,179,179,179,73

%N a(n) = { Smallest prime > k } - k, where k = lcm(1..n).

%t f[n_]:=Module[{lcm=LCM@@Range[n]},NextPrime[lcm]-lcm]; Join[{1}, Array[f,70]] (* _Harvey P. Dale_, May 20 2011 *)

%o (PARI) a(n) = my(lc = lcm([1..n])); nextprime(lc+1) - lc; \\ _Michel Marcus_, Mar 18 2018

%K nonn

%O 0,9

%A _N. J. A. Sloane_, Apr 01 2001