cp's OEIS Frontend

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.

A202954 Number of partitions of [1,...,3n] into triples satisfying x+y=4z.

This page as a plain text file.
%I A202954 #21 Jan 17 2021 12:57:18
%S A202954 1,0,0,0,0,0,0,0,6,0,5,0,0,349,0,443,0,0,110757,0,1254452,0,0,
%T A202954 152965479,0
%N A202954 Number of partitions of [1,...,3n] into triples satisfying x+y=4z.
%C A202954 a(n)=0 when n is not congruent to 0 or 3 mod 5. - _Edward Moody_, Jan 17 2021
%H A202954 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.] See Table II.6.
%Y A202954 Cf. A108235, A104429.
%K A202954 nonn,more
%O A202954 0,9
%A A202954 _N. J. A. Sloane_, Dec 26 2011
%E A202954 a(14)-a(17) from _Alois P. Heinz_, Dec 28 2011
%E A202954 a(18) from _Alois P. Heinz_, Jan 04 2012
%E A202954 a(19)-a(24) from _Edward Moody_, Jan 17 2021