id:A088901 - OEIS Search Results

Search: id:A088901

Displaying 1-1 of 1 results found.

page 1

Numbers n such that n*k(n) is an integer, where k(n) is sum of successive remainders when computing the euclidean algorithm for (1,1/sqrt(n)) as defined in A086378 (MuPAD program is given there).

+0
1

1, 2, 4, 9, 12, 16, 25, 30, 36, 49, 55, 56, 64, 70, 81, 90, 100, 121, 132, 144, 169, 180, 182, 196, 225, 240, 256, 289, 305, 306, 324, 361, 377, 380, 400, 441, 462, 484, 529, 552, 576, 625, 646, 650, 676, 729, 755, 756, 784, 841, 870, 900, 961, 987, 990, 992 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`Subset of A086378 and A088900.`
	CROSSREFS	`Cf. A086378 and A088900.` `Sequence in context: A058885 A022428 A096186 this_sequence A111302 A092530 A154891` `Adjacent sequences: A088898 A088899 A088900 this_sequence A088902 A088903 A088904`
	KEYWORD	`nonn`
	AUTHOR	`Thomas Baruchel (baruchel(AT)users.sourceforge.net), Oct 21 2003`

page 1

Search completed in 0.002 seconds

Last modified December 17 19:39 EST 2009. Contains 170821 sequences.

AT&T Labs Research