|
%I #17 Apr 10 2017 00:05:39
%S 1,1,0,0,6,10,0,0,700
%N Number of Nickerson-type partitions of [1,...,3n] into triples satisfying x+y=z.
%H R. S. Nickerson, <a href="http://www.jstor.org/stable/2313936">Problem E1845</a>, Amer. Math. Monthly, p. 81, 73 (1966).
%H 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 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 Cf. A108235, A202952.
%K nonn,more
%O 0,5
%A _N. J. A. Sloane_, Dec 26 2011
|
