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 A274779 #23 Jul 11 2016 20:05:07
%S A274779 2,3,5,6,7,8,10,12,13,18,20,27,28,33,37,42,45,47,55,58,60,62,63,65,67,
%T A274779 73,75,78,80,85,88,90,92,102,103,105,112,115,118,120,125,128,130,132,
%U A274779 135,140,142,150,153,157,163,170,175,192,193,198,200,203,210,215,218,220,222
%N A274779 Numbers whose square is the sum of two positive triangular numbers in exactly one way.
%C A274779 Obviously, A000217(n) + A000217(n+1) = n*(n+1)/2 + (n+1)*(n+2)/2 = (n+1)^2. So every square that is greater than 1 is the sum of two positive consecutive triangular numbers. This sequence focuses on the squares that have only this trivial solution.
%C A274779 For a related comment, see comments section of A001912.
%e A274779 3 is a term because 3^2 is the sum of two positive triangular numbers in exactly 1 way that is: 3^2 = 3 + 6.
%t A274779 nR[n_]:= (SquaresR[2, n]+Plus@@ Pick[{-4, 4}, IntegerQ/@ Sqrt[{n, n/2}]])/8 ; nTr[n_] := nR[8*n + 2] - Boole@ IntegerQ@ Sqrt[8*n + 1]; Select[Range[250], nTr[#^2]==1 &] (* _Giovanni Resta_, Jul 08 2016 *)
%Y A274779 Cf. A000217, A000290, A001912, A230312, A274758.
%K A274779 nonn,easy
%O A274779 1,1
%A A274779 _Altug Alkan_, Jul 06 2016