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 A114435 #13 Feb 16 2025 08:32:59
%S A114435 8,16,20,23,26,36,40,45,49,50,51,53,59,60,62,65,68,69,74,76,77,83,88,
%T A114435 89,91,92,100,103,105,110,114,115,117,123,126,129,131,136,139,146,149,
%U A114435 150,151,154,156,165,169,182,185,186,187,194,196,197,198,206,210
%N A114435 Indices of 4-almost prime triangular numbers.
%H A114435 Vincenzo Librandi, <a href="/A114435/b114435.txt">Table of n, a(n) for n = 1..1000</a>
%H A114435 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/TriangularNumber.html">Triangular Number.</a>
%H A114435 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/AlmostPrime.html">Almost Prime.</a>
%F A114435 {a(n)} = {k such that A001222(A000217(k)) = 4}. {a(n)} = {k such that k*(k+1)/2 has exactly 4 prime factors, with multiplicity}. {a(n)} = {k such that A000217(k) is an element of A014613}.
%F A114435 { m : A069904(m) = 4 }. - _Alois P. Heinz_, Aug 05 2019
%e A114435 a(1) = 8 because T(8) = TriangularNumber(8) = 8*(8+1)/2 = 36 = 2^2 * 3^2 is a 4-almost prime.
%e A114435 a(2) = 16 because T(16) = 16*(16+1)/2 = 136 = 2^3 * 17 is a 4-almost prime.
%e A114435 a(3) = 20 because T(20) = 20*(20+1)/2 = 210 = 2 * 3 * 5 * 7 (210 = primorial 4#).
%e A114435 a(4) = 23 because T(23) = 23*(23+1)/2 = 276 = 2^2 * 3 * 23.
%e A114435 a(5) = 26 because T(26) = 26*(26+1)/2 = 351 = 3^3 * 13.
%e A114435 a(6) = 36 because T(36) = 36*(36+1)/2 = 666 = 2 * 3^2 * 37.
%e A114435 a(27) = 100 because T(100) = 100*(100+1)/2 = 5050 = 2 * 5^2 * 101.
%e A114435 a(57) = 210 because T(210) = 210*(210+1)/2 = 22155 = 3 * 5 * 7 * 211 (again, 210 = primorial 4#).
%t A114435 Flatten[Position[Accumulate[Range[800]], _?(PrimeOmega[#]== 4 &)]] (* _Vincenzo Librandi_, Apr 09 2014 *)
%o A114435 (PARI) is(n)=my(t=bigomega(n/gcd(n,2))); if(t<3, bigomega((n+1)/gcd(n+1,2))+t==4, t==3 && isprime((n+1)/gcd(n+1,2))) \\ _Charles R Greathouse IV_, Jun 14 2017
%Y A114435 Cf. A000217, A001222, A014613, A069904.
%K A114435 easy,nonn
%O A114435 1,1
%A A114435 _Jonathan Vos Post_, Feb 13 2006