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 A307598 #7 Apr 28 2020 11:40:41 %S A307598 0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,1,0,2,0,0,1,0,1,1,1,0,2,0,1,1,2,0, %T A307598 1,1,0,3,0,2,1,1,1,1,2,1,2,1,0,3,1,0,4,1,2,1,1,1,2,2,1,3,1,2,2,1,2,3, %U A307598 1,1,3,2,2,2,2,1,3,2,0,4,1,1,5,1,3,2,2,3,2,2,1,4,1,2,4,2,2,3,2,1,3,2,4,3,3,2,2,3,1,6 %N A307598 Number of partitions of n into 3 distinct positive triangular numbers. %C A307598 The greedy inverse starts 0, 10, 19, 37, 52, 82, 109, 136, 241, 226, 217, 247, 364, 427, 457, 541, 532, 577, 637, 961, 721, 787, 1066, 1102, 1381, 1267, 1564, 1192, 1396, 1816, 1501, 1612, 1927, 1942, 2242, 1792, 2842, 2587, 2557, 2422, ... - _R. J. Mathar_, Apr 28 2020 %F A307598 a(n) = [x^n y^3] Product_{k>=1} (1 + y*x^(k*(k+1)/2)). %e A307598 a(19) = 2 because we have [15, 3, 1] and [10, 6, 3]. %Y A307598 Cf. A000217, A002244, A008443, A024940, A025442, A053604, A063993, A224326, A307597. %K A307598 nonn %O A307598 0,20 %A A307598 _Ilya Gutkovskiy_, Apr 17 2019