id:A024359 - OEIS Search Results

Search: id:A024359

Displaying 1-1 of 1 results found.

page 1

Consider primitive Pythagorean triangles (A^2 + B^2 = C^2, (A, B) = 1, A <= B); sequence gives number of times A takes value n.

+0
1

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

	OFFSET	`1,20`
	LINKS	`Ron Knott, Pythagorean Triples and Online Calculators`
	CROSSREFS	`Sequence in context: A131038 A016353 A016398 this_sequence A088705 A065712 A153172` `Adjacent sequences: A024356 A024357 A024358 this_sequence A024360 A024361 A024362`
	KEYWORD	`nonn`
	AUTHOR	`David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified December 20 00:58 EST 2009. Contains 171054 sequences.

AT&T Labs Research