A066958 - OEIS

This site is supported by donations to The OEIS Foundation.

A066958

Number of ordered primitive solutions (x,y,z) to xy + yz + zx = n with x,y,z >= 1.

0, 0, 1, 0, 3, 0, 3, 3, 3, 0, 9, 0, 3, 6, 6, 3, 9, 0, 9, 6, 6, 0, 15, 6, 3, 12, 9, 0, 15, 0, 15, 9, 6, 6, 18, 6, 3, 12, 18, 6, 21, 0, 9, 12, 6, 6, 27, 6, 9, 12, 18, 6, 15, 12, 18, 18, 6, 0, 33, 0, 15, 18, 18, 9, 18, 12, 9, 18, 18, 0, 39, 6, 9, 24, 18, 12, 18, 0, 27, 18, 15, 6, 33, 12, 6, 24, 30 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,5`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..1000`
	CROSSREFS	`Cf. A066851.` `Sequence in context: A096597 A097994 A053604 * A066851 A167223 A078907` `Adjacent sequences: A066955 A066956 A066957 * A066959 A066960 A066961`
	KEYWORD	`nonn,easy`
	AUTHOR	`Colin Mallows (colinm(AT)research.avayalabs.com) Jan 26 2002`
	EXTENSIONS	`More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 14 2002`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 09:11 EST 2012. Contains 206005 sequences.