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 A295768 #9 Dec 26 2017 18:28:13
%S A295768 990,1540,2850,4851,8778,11781,15400,26796,43956,61425,61776,70125,
%T A295768 105570,145530,176715,189420,270480,303810,349866,437580,526851,
%U A295768 715806,719400,749700,799480,810901,828828,1037520,1050525,1185030,1493856,1788886,1921780,2001000
%N A295768 Triangular numbers that can be represented as a sum of two distinct triangular numbers, and as a product of two triangular numbers greater than 1.
%C A295768 Intersection of A188630 and A260647.
%e A295768 990 is representable as a product of two triangular numbers, 990 = 660 * 15, and as a sum, 990 = 780 + 210, therefore 990 is in the sequence.
%t A295768 maxTerm = 3*10^6; imax = Ceiling[(Sqrt[8*maxTerm + 1] - 1)/2];
%t A295768 TriangularQ[n_] := IntegerQ[Sqrt[8n + 1]];
%t A295768 t[op_] := Table[If[1 < i < j, op[i*(i + 1)/2 , j*(j + 1)/2], Nothing], {i, 2, imax}, {j, i + 1, imax}] // Flatten // Select[#, # <= maxTerm && TriangularQ[#]&]& // Union;
%t A295768 Intersection[t[Plus], t[Times]] (* _Jean-François Alcover_, Dec 05 2017 *)
%Y A295768 Cf. A000217, A188630, A260647.
%K A295768 nonn
%O A295768 1,1
%A A295768 _Alex Ratushnyak_, Nov 27 2017