id:A109010 - OEIS Search Results

Search: id:A109010

Displaying 1-1 of 1 results found.

page 1

GCD(n,7).

+0
3

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

	OFFSET	`0,1`
	FORMULA	`a(n) = 1 + 6*[7\|n], where [x\|y] = 1 when x divides y, 0 otherwise.` `a(n) = a(n-7).` `Multiplicative with a(p^e, 7) = GCD(p^e, 7). David W. Wilson (davidwwilson(AT)comcast.net) Jun 12, 2005.`
	CROSSREFS	`Cf. A109004.` `Sequence in context: A055061 A074465 A081229 this_sequence A117825 A010143 A101027` `Adjacent sequences: A109007 A109008 A109009 this_sequence A109011 A109012 A109013`
	KEYWORD	`nonn,easy,mult`
	AUTHOR	`Mitch Harris (Harris.Mitchell(AT)mgh.harvard.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 25 13:47 EST 2009. Contains 167481 sequences.

AT&T Labs Research