id:A046080 - OEIS Search Results

Search: id:A046080

Displaying 1-1 of 1 results found.

page 1

a(n) = number of integer sided right triangles with hypotenuse n.

+0
24

0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 2, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 2, 1, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 4, 0, 0, 1, 0, 1, 0, 0, 1, 1, 2, 0, 0, 1, 0, 1, 0, 1, 0, 0, 4, 0, 1, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0 (list; graph; listen)

	OFFSET	`1,25`
	COMMENT	`a(n)=0 for n in A004144. - Lekraj Beedassy (blekraj(AT)yahoo.com), May 14 2004`
	REFERENCES	`A. H. Beiler, Recreations in the Theory of Numbers, New York: Dover, pp. 116-117, 1966.`
	LINKS	`Ron Knott, Pythagorean Triples and Online Calculators` `Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.` `F. Richman, Pythagorean Triples`
	FORMULA	`Let n = 2^e_2 * product_i p_i^f_i * product_j q_j^g_j where p_i == 1 mod 4, q_j == 3 mod 4; then a(n) = (1/2)(product_i (2f_i + 1) - 1). - Beiler, corrected` `8*a(n) + 4 = A046109(n) for n > 0. - Ralf Stephan, Mar 14 2004`
	CROSSREFS	`First differs from A083025 at n=65.` `Cf. A046079, A046081, A046082, A024362.` `Cf. A009000.` `Sequence in context: A015964 A088950 A083025 this_sequence A035227 A049340 A056929` `Adjacent sequences: A046077 A046078 A046079 this_sequence A046081 A046082 A046083`
	KEYWORD	`nonn`
	AUTHOR	`Eric Weisstein (eric(AT)weisstein.com)`

page 1

Search completed in 0.002 seconds

Last modified December 5 17:24 EST 2009. Contains 170342 sequences.

AT&T Labs Research