cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A060360 a(n) = k - (largest prime < k), where k = lcm(1..n).

This page as a plain text file.
%I A060360 #12 Mar 20 2018 06:54:34
%S A060360 1,1,1,1,1,1,17,17,19,19,23,23,23,17,43,43,1,1,1,1,1,1,29,29,41,41,1,
%T A060360 1,43,1,1,1,1,1,43,43,43,43,47,47,83,83,83,83,1,1,83,83,83,83,61,61,
%U A060360 61,61,61,61,149,149,1,1,1,97,97,97,89,89,89,89,109,109
%N A060360 a(n) = k - (largest prime < k), where k = lcm(1..n).
%F A060360 a(n) = A049711(A003418(n)). - _Michel Marcus_, Mar 20 2018
%t A060360 lcmp[n_]:=Module[{c=LCM@@Range[n]},c-NextPrime[c,-1]]; Array[lcmp,80,3] (* _Harvey P. Dale_, Dec 22 2012 *)
%o A060360 (PARI) a(n) = my(lc = lcm([1..n])); lc - precprime(lc-1); \\ _Michel Marcus_, Mar 20 2018
%Y A060360 Cf. A003418, A049711.
%K A060360 nonn
%O A060360 3,7
%A A060360 _N. J. A. Sloane_, Apr 01 2001