id:A070077 - OEIS Search Results

Search: id:A070077

Displaying 1-1 of 1 results found.

page 1

Greatest common divisor of n-th square-free number and n-th cube-free number.

+0
2

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

	OFFSET	`1,2`
	COMMENT	`a(n) is square-free;` `Conjecture: for any square-free k exists m such that a(m)=k; see A070078.`
	LINKS	`Eric Weisstein's World of Mathematics, square-free numbers.` `Eric Weisstein's World of Mathematics, cube-free numbers.`
	FORMULA	`a(n) = GCD(A005117(n), A004709(n)).`
	EXAMPLE	`a(10)=GCD(A005117(10), A004709(10))=GCD(14,11)=1.` `a(11)=GCD(A005117(11), A004709(11))=GCD(15,12)=3GCD(5,4)=31=3.`
	CROSSREFS	`Sequence in context: A004579 A081371 A027870 this_sequence A122587 A086195 A086197` `Adjacent sequences: A070074 A070075 A070076 this_sequence A070078 A070079 A070080`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Apr 22 2002`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research