id:A109009 - OEIS Search Results

Search: id:A109009

Displaying 1-1 of 1 results found.

page 1

GCD(n,5).

+0
3

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

	OFFSET	`0,1`
	FORMULA	`a(n) = 1 + 4*[5\|n], where [x\|y] = 1 when x divides y, 0 otherwise.` `a(n) = a(n-5).` `Multiplicative with a(p^e, 5) = GCD(p^e, 5). David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.`
	CROSSREFS	`Cf. A109004.` `Sequence in context: A031261 A161685 A129398 this_sequence A060904 A135469 A046622` `Adjacent sequences: A109006 A109007 A109008 this_sequence A109010 A109011 A109012`
	KEYWORD	`nonn,easy,mult`
	AUTHOR	`Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)`

page 1

Search completed in 0.002 seconds

Last modified December 2 11:54 EST 2009. Contains 167921 sequences.

AT&T Labs Research