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 A202951 #22 Jul 09 2025 22:28:39 %S A202951 1,1,0,0,6,10,0,0,700 %N A202951 Number of Nickerson-type partitions of [1,...,3n] into triples satisfying x+y=z. %C A202951 Perhaps an incorrect version of A004075? Sequence values are from p. 51 of Nowakowski. - _Martin Fuller_, Jul 06 2025 %H A202951 R. S. Nickerson, <a href="http://www.jstor.org/stable/2313936">Problem E1845</a>, Amer. Math. Monthly, p. 81, 73 (1966). %H A202951 R. S. Nickerson and D. C. B. Marsh, <a href="http://www.jstor.org/stable/2314911">E1845: A variant of Langford's Problem</a>, American Math. Monthly, 1967, 74, 591-595. %H A202951 R. J. Nowakowski, <a href="/A104429/a104429.pdf">Generalizations of the Langford-Skolem problem</a>, M.S. Thesis, Dept. Math., Univ. Calgary, May 1975. [Scanned copy, with permission.] %Y A202951 Cf. A108235, A202952. %K A202951 nonn,more %O A202951 0,5 %A A202951 _N. J. A. Sloane_, Dec 26 2011