|
%I #32 Apr 10 2017 13:07:07
%S 0,0,1,3,9,30,117,512,2597,14892,99034,721350,5909324,52578654,
%T 516148082,5422071091,61889692290,749456672155
%N Number of reducible ways to split 1, 2, 3, ..., 3n into n arithmetic progressions each with 3 terms: a(n) = A104429(n) - A202705(n).
%D R. K. Guy, Sedlacek's Conjecture on Disjoint Solutions of x+y= z, Univ. Calgary, Dept. Mathematics, Research Paper No. 129, 1971.
%D R. K. Guy, Sedlacek's Conjecture on Disjoint Solutions of x+y= z, in Proc. Conf. Number Theory. Pullman, WA, 1971, pp. 221-223.
%D R. K. Guy, Packing [1,n] with solutions of ax + by = cz; the unity of combinatorics, in Colloq. Internaz. Teorie Combinatorie. Rome, 1973, Atti Conv. Lincei. Vol. 17, Part II, pp. 173-179, 1976.
%H R. K. Guy, Letter to N. J. A. Sloane, June 24 1971: <a href="/A002572/a002572.jpg">front</a>, <a href="/A002572/a002572_1.jpg">back</a> [Annotated scanned copy, with permission] See sequence "L".
%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 All of A279197, A279198, A202705, A279199, A104429, A282615 are concerned with counting solutions to X+Y=2Z in various ways.
%Y See also A002848, A002849.
%K nonn,more
%O 0,4
%A _N. J. A. Sloane_, Dec 15 2016
%E Definition corrected by _N. J. A. Sloane_, Jan 09 2017 at the suggestion of _Fausto A. C. Cariboni_.
%E a(15)-a(17) from _Fausto A. C. Cariboni_, Feb 22 2017
|
