id:A074695 - OEIS Search Results

Search: id:A074695

Displaying 1-1 of 1 results found.

page 1

Greatest common divisor of n and floor(n^(1/2))^2.

+0
1

1, 1, 1, 4, 1, 2, 1, 4, 9, 1, 1, 3, 1, 1, 3, 16, 1, 2, 1, 4, 1, 2, 1, 8, 25, 1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 36, 1, 2, 3, 4, 1, 6, 1, 4, 9, 2, 1, 12, 49, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 64, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 1, 4, 1, 2, 1, 16, 81, 1, 1, 3, 1, 1, 3, 1, 1, 9, 1, 1, 3, 1, 1, 3, 1, 1, 9, 100 (list; graph; listen)

	OFFSET	`1,4`
	COMMENT	`a(n)=n iff n is a square.`
	FORMULA	`a(n) = GCD(n, A048760(n)).`
	CROSSREFS	`Cf. A000196, A000290.` `Sequence in context: A087230 A030787 A109008 this_sequence A069098 A126241 A019777` `Adjacent sequences: A074692 A074693 A074694 this_sequence A074696 A074697 A074698`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 03 2002`

page 1

Search completed in 0.002 seconds

Last modified December 6 13:45 EST 2009. Contains 170429 sequences.

AT&T Labs Research