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 A157936 #10 Jul 25 2024 14:08:38
%S A157936 2,4,6,9,10,15,20,25,28,35,42,49,55,66,77,88,99,110,121,130,143,156,
%T A157936 169,170,187,204,221,238,255,272,289,304,323,342,361,368,391,414,437,
%U A157936 460,483,506,529,551,580,609,638,667,696,725,754,783,812,841,868,899,930
%N A157936 Numbers n divisible by the least prime >= sqrt(n).
%C A157936 Contains A001248, A006094 and A157937 as subsequences.
%F A157936 A157936 = A157937 union A001248
%t A157936 dQ[n_]:=Module[{srn=Sqrt[n],x},x=If [PrimeQ[srn],srn,NextPrime[srn]];Divisible[n,x]]; Select [Range[1000],dQ] (* _Harvey P. Dale_, Mar 12 2011 *)
%o A157936 (PARI) for( n=1,1999, n % nextprime(sqrtint(n-1)+1) || print1(n",")) /* sqrtint(n-1)+1 avoids rounding errors but can be replaced by sqrt(n) for small n */
%Y A157936 Cf. A157942.
%K A157936 nonn
%O A157936 1,1
%A A157936 _M. F. Hasler_, Mar 10 2009