The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080497 a(n) = (n-p_1)(n-p_2)...(n-p_k) where p_k is the k-th prime and is also the largest prime < n. 4

%I #9 Dec 01 2018 07:59:17

%S 1,1,1,2,6,12,40,90,336,840,1728,3150,10560,24948,99840,270270,604800,

%T 1201200,4386816,11277630,49029120,143896500,348364800,746876130,

%U 2937876480,8117240040,18923520000,39628338750,76859228160,140548508100

%N a(n) = (n-p_1)(n-p_2)...(n-p_k) where p_k is the k-th prime and is also the largest prime < n.

%e a(6) = (6-2)(6-3)(6-5) = 12. a(7) = (7-2)(7-3)(7-5) = 40.

%t a[n_] := Product[n - Prime[k], {k, 1, PrimePi[n - 1]}]; Array[a, 30] (* _Amiram Eldar_, Dec 01 2018 *)

%o (PARI) a(n) = my(mk = primepi(n-1)); prod(k=1, mk, n-prime(k)); \\ _Michel Marcus_, Dec 01 2018

%Y Cf. A080498, A072513, A080500.

%K nonn

%O 1,4

%A _Amarnath Murthy_, Mar 19 2003

%E More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 4 19:35 EDT 2024. Contains 373102 sequences. (Running on oeis4.)