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 A137723 #8 Oct 07 2024 11:04:39
%S A137723 10,33,20,55,84,114,390,513,182,200,468,2941,774,65522,1832,1261,1130,
%T A137723 1332,1638,524289,1952,4298,4524,69960,5120,16385,2972,4832,5352,
%U A137723 10801,5592
%N A137723 First occurrence of a set of n consecutive numbers having at least one prime gap in their factorization: a(n) = smallest number of this set.
%C A137723 A073490(a(n)+k)>0 for 0<=k<n and A073490(a(n)-1)=A073490(a(n)+n)=0.
%C A137723 Continuation after the missing a(14): 1832, 1261, 1130, 1332, 1638, missing, 1952,4298, 4524, missing, 5120, 16385, 2972, 4832, 5352, 10801, 5592, missing, 8468, missing, 9552, missing, 39462, missing, 20810, missing, 38502, missing, 15684, ...
%C A137723 a(32) > 10^11. - _Lucas A. Brown_, Oct 07 2024
%H A137723 Lucas A. Brown, <a href="https://github.com/lucasaugustus/oeis/blob/main/A137723.py">Python program</a>.
%e A137723 a(5) = 84: #{84, 85, 86, 87, 88} = 5,
%e A137723 84=[7]*[3*2^2], 84+1=19*5, 84+2=43*2, 84+3=29*3, 84+4=11*2^3.
%Y A137723 Cf. A073492.
%K A137723 nonn,more,hard
%O A137723 1,1
%A A137723 _Reinhard Zumkeller_, Feb 09 2008
%E A137723 Discovered a(14) and some more terms from _Sean A. Irvine_, Sep 27 2009