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 A242442 #9 May 16 2014 15:49:43
%S A242442 1,2,1,1,1,1,2,1,2,2,2,3,2,2,2,4,2,0,2,2,2,2,3,4,2,3,3,2,4,3,5,2,2,3,
%T A242442 2,4,5,4,1,3,3,4,1,2,3,5,5,1,3,5,5,4,4,4,4,2,5,4,5,4,5,4,2,5,4,4,4,4,
%U A242442 2,4,5,5,2,2,6,5,4,2,4,6,7,7,2,3,5,6,5,5,5,2,5,9,3,5,2,8,6,1,8,3
%N A242442 Number of ways of writing n, a positive integer, as an unordered sum of a triangular number (A000217), an odd square (A016754) and a pentagonal number (A000326).
%C A242442 It is conjectured that only 18 cannot be so represented. See Sun, p. 4, Remark 1.2 (b).
%H A242442 Zhi-Wei Sun, <a href="http://arxiv.org/abs/0905.0635">On Universal Sums Of Polygonal Numbers</a>, arXiv:0905.0635v18 [math.NT] 26 Oct 2011
%t A242442 planeFigurative[n_, r_] := (n - 2) Binomial[r, 2] + r; s = Sort@ Flatten@ Table[ planeFigurative[3, i] + planeFigurative[4, j] + planeFigurative[5, k], {i, 0, 20}, {j, 1, 11, 2}, {k, 0, 8}]; Table[ Count[s, n], {n, 0, 104}]
%Y A242442 Cf. A002636, A115288, A160324, A160325, A160326, A240088, A242443.
%K A242442 nonn,easy
%O A242442 1,2
%A A242442 _Robert G. Wilson v_, May 14 2014