login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
1, 1, 1, 2, 6, 12, 40, 90, 336, 840, 1728, 3150, 10560, 24948, 99840, 270270, 604800, 1201200, 4386816, 11277630, 49029120, 143896500, 348364800, 746876130, 2937876480, 8117240040, 18923520000, 39628338750, 76859228160, 140548508100 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,4

LINKS

Table of n, a(n) for n=1..30.

EXAMPLE

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

MATHEMATICA

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

PROG

(PARI) a(n) = my(mk = primepi(n-1)); prod(k=1, mk, n-prime(k)); \\ Michel Marcus, Dec 01 2018

CROSSREFS

Cf. A080498, A072513, A080500.

Sequence in context: A280171 A327879 A094261 * A127724 A178008 A266005

Adjacent sequences:  A080494 A080495 A080496 * A080498 A080499 A080500

KEYWORD

nonn

AUTHOR

Amarnath Murthy, Mar 19 2003

EXTENSIONS

More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 08:16 EDT 2021. Contains 348074 sequences. (Running on oeis4.)