login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A083722
Product of primes greater than the greatest prime factor of n but not greater than n.
6
1, 1, 1, 3, 1, 5, 1, 105, 35, 7, 1, 385, 1, 143, 1001, 15015, 1, 85085, 1, 323323, 46189, 4199, 1, 37182145, 7436429, 7429, 37182145, 1062347, 1, 215656441, 1, 100280245065, 86822723, 392863, 955049953, 33426748355, 1, 765049, 247110827, 247357937827, 1, 1448810778701, 1
OFFSET
1,4
COMMENTS
a(n) = 1 iff n is prime or n is 1.
Apart from 1-terms, the other duplicated terms are: a(24) = a(27), a(120) = a(125), a(140) = a(147), a(528) = a(539), etc, whose positions are listed by A293893 and A293894. - Antti Karttunen, Nov 01 2017
LINKS
FORMULA
MATHEMATICA
Array[Times @@ Select[Prime@ Range[#1, #1 + #2], Function[p, p <= #3]] & @@ {PrimePi@ NextPrime[FactorInteger[#][[-1, 1]]], PrimePi@ #, #} &, 43] (* Michael De Vlieger, Nov 01 2017 *)
PROG
(PARI) a(n) = {if (n==1, return (1)); my(gpf = vecmax(factor(n)[, 1])); my(pp = 1); forprime(p=gpf+1, n, pp *= p; ); pp; } \\ Michel Marcus, Jun 26 2016
CROSSREFS
Cf. A293892 (restricted growth sequence transform), A293893, A293894.
Sequence in context: A166086 A232101 A176249 * A111426 A100576 A212332
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, May 04 2003
EXTENSIONS
More terms from Michel Marcus, Jun 26 2016
STATUS
approved