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 A307597 #18 Jan 06 2024 01:19:52
%S A307597 0,0,0,0,1,0,0,1,0,1,0,1,0,1,0,0,2,0,1,0,0,1,1,0,1,1,0,1,0,1,0,2,0,0,
%T A307597 1,0,1,1,1,1,0,0,1,1,0,0,2,0,1,1,0,2,0,0,0,1,1,1,1,0,1,1,0,0,1,1,1,1,
%U A307597 0,1,1,0,1,1,0,0,2,0,0,1,0,3,0,1,1,0,0,1,1,0,0,1,1,1,2,0,0,1,0,1,1,1,1,0,0,0,3,0,1
%N A307597 Number of partitions of n into 2 distinct positive triangular numbers.
%C A307597 The greedy inverse (positions of first occurrence of n) starts 0, 4, 16, 81, 471, 2031, 1381, 11781, 6906, 17956, ... - _R. J. Mathar_, Apr 28 2020
%H A307597 Alois P. Heinz, <a href="/A307597/b307597.txt">Table of n, a(n) for n = 0..65536</a> (first 10000 terms from David A. Corneth)
%F A307597 a(n) = [x^n y^2] Product_{k>=1} (1 + y*x^(k*(k+1)/2)).
%F A307597 a(n) = Sum_{k=1..floor((n-1)/2)} c(k) * c(n-k), where c = A010054. - _Wesley Ivan Hurt_, Jan 06 2024
%e A307597 a(16) = 2 because we have [15, 1] and [10, 6].
%Y A307597 Cf. A000217, A008441, A024940, A025441, A052344, A053603, A260647, A307598.
%Y A307597 Cf. A010054.
%K A307597 nonn,easy
%O A307597 0,17
%A A307597 _Ilya Gutkovskiy_, Apr 17 2019