login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A202954 Number of partitions of [1,...,3n] into triples satisfying x+y=4z. 2
1, 0, 0, 0, 0, 0, 0, 0, 6, 0, 5, 0, 0, 349, 0, 443, 0, 0, 110757, 0, 1254452, 0, 0, 152965479, 0 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,9

COMMENTS

a(n)=0 when n is not congruent to 0 or 3 mod 5. - Edward Moody, Jan 17 2021

LINKS

Table of n, a(n) for n=0..24.

R. J. Nowakowski, Generalizations of the Langford-Skolem problem, M.S. Thesis, Dept. Math., Univ. Calgary, May 1975. [Scanned copy, with permission.] See Table II.6.

CROSSREFS

Cf. A108235, A104429.

Sequence in context: A112280 A204850 A202394 * A218850 A021627 A257580

Adjacent sequences:  A202951 A202952 A202953 * A202955 A202956 A202957

KEYWORD

nonn,more

AUTHOR

N. J. A. Sloane, Dec 26 2011

EXTENSIONS

a(14)-a(17) from Alois P. Heinz, Dec 28 2011

a(18) from Alois P. Heinz, Jan 04 2012

a(19)-a(24) from Edward Moody, Jan 17 2021

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 08:13 EDT 2021. Contains 347623 sequences. (Running on oeis4.)