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.
%I A083722 #18 Nov 02 2017 15:35:50
%S A083722 1,1,1,3,1,5,1,105,35,7,1,385,1,143,1001,15015,1,85085,1,323323,46189,
%T A083722 4199,1,37182145,7436429,7429,37182145,1062347,1,215656441,1,
%U A083722 100280245065,86822723,392863,955049953,33426748355,1,765049,247110827,247357937827,1,1448810778701,1
%N A083722 Product of primes greater than the greatest prime factor of n but not greater than n.
%C A083722 a(n) = 1 iff n is prime or n is 1.
%C A083722 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
%H A083722 Antti Karttunen, <a href="/A083722/b083722.txt">Table of n, a(n) for n = 1..2001</a>
%F A083722 a(n) = A002110(A049084(A007917(n)))/A002110(A049084(A006530(n))).
%t A083722 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 *)
%o A083722 (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
%Y A083722 Cf. A006530, A083721, A083720.
%Y A083722 Cf. A293892 (restricted growth sequence transform), A293893, A293894.
%K A083722 nonn
%O A083722 1,4
%A A083722 _Reinhard Zumkeller_, May 04 2003
%E A083722 More terms from _Michel Marcus_, Jun 26 2016