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 A055078 #7 Mar 30 2012 18:34:54 %S A055078 33,68,88,103,138,143,173,183,198,208,243,253,278,298,308,313,348,363, %T A055078 373,383,403,413,418,453,468,473,488,523,528,558,563,578,583,593,608, %U A055078 628,638,643,658,663,668,693,698,733,748,753,758,763,768,778,803,838 %N A055078 Write n as a sum of terms of the form (p^2-1)/24 where p is a prime > 4; sequence gives those n which require at least 4 terms. %C A055078 Chowla conjectures that all numbers are the sum of no more than four terms of the form (p^2-1)/24 where p is a prime > 4. %D A055078 R. K. Guy, Unsolved Problems In Number Theory, section C20. %Y A055078 Cf. A024702. %K A055078 nonn %O A055078 1,1 %A A055078 _Jud McCranie_, Jun 20 2000