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 A096175 #16 Jul 07 2023 18:57:24 %S A096175 6,8,12,14,20,24,38,54,62,80,90,110,138,150,164,168,192,194,272,278, %T A096175 314,332,348,398,402,434,500,572,642,644,720,728,762,798,812,860,864, %U A096175 878,920,992,1020,1022,1070,1092,1098,1118,1130,1182,1202,1230,1260,1308 %N A096175 Numbers k such that k^3-1 is an odd semiprime. %H A096175 Hugo Pfoertner, <a href="/A096175/b096175.txt">Table of n, a(n) for n = 1..10000</a> %H A096175 Dario A. Alpern, <a href="https://www.alpertron.com.ar/ECM.HTM">Factorization using the Elliptic Curve Method</a> %e A096175 a(1)=6 because 6^3 - 1 = 216 - 1 = 215 = 5*43. %o A096175 (PARI) %o A096175 forstep (k=2,1310,2,if(bigomega(k^3-1)==2,print1(k,", "))) %o A096175 \\ _Hugo Pfoertner_, Nov 28 2017 %Y A096175 Cf. A096173: k^3+1 is an odd semiprime; A081257: largest prime factor of k^3-1; A096176 (k^3-1)/(k-1) is prime; A046315. %K A096175 nonn %O A096175 1,1 %A A096175 _Hugo Pfoertner_, Jun 22 2004