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 A072730 #11 Mar 23 2021 05:20:32
%S A072730 788,789,3098,5408,7718,10028,12338,14648,15804,16958,19268,21578,
%T A072730 23888,26198,28508,30818,30819,33128,35438,37748,40058,40830,42368,
%U A072730 44678,45834,46988,49298,51608,53918,56228,58538,60848,60849,63158
%N A072730 Smallest of 5 consecutive integers divisible respectively by 5 consecutive primes.
%H A072730 Amiram Eldar, <a href="/A072730/b072730.txt">Table of n, a(n) for n = 1..10000</a>
%e A072730 3098 is a term as 3098, 3099, 3100, 3101 and 3102 are divisible by 2, 3, 5, 7 and 11 respectively.
%t A072730 f[n_Integer] := Flatten[ Table[ #1] & @@@ FactorInteger[n]]; NextPrim[n_] := Block[ {k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; Do[ p = f[ n ]; l = Length[ p ]; t = Table[n + i, {i, 0, 4} ]; k = 1; While[ k < l + 1 && Union[ Mod[ t, NestList[ NextPrim, p[[ k ]], 4 ]]] != {0}, k++ ]; If[ k < l + 1, Print[ n ]], {n, 2, 72397} ]
%t A072730 cicpQ[n_]:=Module[{num=Range[n,n+4],pr=PrimePi[n+4]-4},Total [Boole[ AllTrue[ #, IntegerQ]&/@Table[num/Prime[Range[k,k+4]],{k,pr}]]]>0]; Select[ Range[ 64000],cicpQ] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Sep 11 2019 *)
%Y A072730 Cf. A073606, A073607, A072555, A073755, A073756, A072562.
%K A072730 nonn
%O A072730 1,1
%A A072730 _Robert G. Wilson v_, Aug 07 2002