id:A063658 - OEIS Search Results

Search: id:A063658

Displaying 1-1 of 1 results found.

page 1

Numbers 1<=m<=n for which GCD(m,n) is divisible by a square greater than 1.

+0
2

0, 0, 0, 1, 0, 0, 0, 2, 1, 0, 0, 3, 0, 0, 0, 4, 0, 2, 0, 5, 0, 0, 0, 6, 1, 0, 3, 7, 0, 0, 0, 8, 0, 0, 0, 12, 0, 0, 0, 10, 0, 0, 0, 11, 5, 0, 0, 12, 1, 2, 0, 13, 0, 6, 0, 14, 0, 0, 0, 15, 0, 0, 7, 16, 0, 0, 0, 17, 0, 0, 0, 24, 0, 0, 3, 19, 0, 0, 0, 20, 9, 0, 0, 21, 0, 0, 0, 22, 0, 10, 0, 23, 0, 0, 0, 24 (list; graph; listen)

	OFFSET	`1,8`
	EXAMPLE	`For n=12 we find GCD(4,12), GCD(8,12) and GCD(12,12) divisible by 4, so a(12)=3.`
	CROSSREFS	`a(n)=n-A063659(n)` `Sequence in context: A059220 A059431 A113263 this_sequence A132013 A128229 A105820` `Adjacent sequences: A063655 A063656 A063657 this_sequence A063659 A063660 A063661`
	KEYWORD	`nonn`
	AUTHOR	`Floor van Lamoen (fvlamoen(AT)hotmail.com), Jul 24 2001`
	EXTENSIONS	`More terms from Larry Reeves (larryr(AT)acm.org), Vladeta Jovovic (vladeta(AT)Eunet.yu) and Dean Hickerson, Jul 26 2001`

page 1

Search completed in 0.002 seconds

Last modified November 30 22:12 EST 2008. Contains 150989 sequences.

AT&T Labs Research