cp's OEIS Frontend

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.

A157937 Numbers n divisible by the least prime >= sqrt(n) which are not in A001248 (primes squared).

This page as a plain text file.
%I A157937 #9 Apr 11 2020 14:53:26
%S A157937 6,10,15,20,28,35,42,55,66,77,88,99,110,130,143,156,170,187,204,221,
%T A157937 238,255,272,304,323,342,368,391,414,437,460,483,506,551,580,609,638,
%U A157937 667,696,725,754,783,812,868,899,930,962,999,1036,1073,1110,1147,1184,1221
%N A157937 Numbers n divisible by the least prime >= sqrt(n) which are not in A001248 (primes squared).
%C A157937 A subsequence of A157936, contains A157938 as subsequence: cf. formulas.
%H A157937 Hugo Pfoertner, <a href="/A157937/b157937.txt">Table of n, a(n) for n = 1..10000</a>
%F A157937 Equals A157936 \ A001248 = A157938 union A006094.
%o A157937 (PARI) for( n=5,1999, n % nextprime(sqrtint(n-1)+1) & next; omega(n)>1 & print1(n",")) /* sqrtint(n-1)+1 avoids rounding errors but could be replaced by sqrt(n) for small n */
%Y A157937 Cf. A157941.
%K A157937 nonn
%O A157937 1,1
%A A157937 _M. F. Hasler_, Mar 10 2009