A146974 - OEIS

This site is supported by donations to The OEIS Foundation.

A146974

For n that there're no non-zero integer solution for Diophantine equation a1^2+a2^2+...+an^2=a1a2...an.

2, 6, 9, 11, 12, 15, 16, 18, 20, 21, 24, 29, 32, 33, 36, 41, 42, 45, 48, 50, 51, 56, 57, 60, 66, 72, 76, 77, 81, 82, 84, 90, 96, 99 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	`Here all n which is no more than 100 and the correspondent equation has only zero soltuion is provided. In the link, a C++ program calling GMP library is provided to solve such kind of equations.`
	LINKS	`Link for the problem to be solved` `A Chinese webpage where the problem is raised`
	EXAMPLE	`Such as for n=3, there're non-zero solutions 3^2+3^2+3^2=333;3^2+6^2+15^2=3615 and for n=4, there're non-zero solutions 2^2+2^2+2^2+2^2=2222;2^2+6^2+22^2+262^2=2622262 But for n=2, there's no non-zero solutions for equation a^2+b^2=ab`
	CROSSREFS	`Sequence in context: A109600 A071814 A066586 * A133160 A128906 A192420` `Adjacent sequences: A146971 A146972 A146973 * A146975 A146976 A146977`
	KEYWORD	`nonn`
	AUTHOR	`Du, Zhao Hui (zhao.hui.du(AT)gmail.com), Nov 04 2008`

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

Last modified February 16 11:51 EST 2012. Contains 205908 sequences.